Search Results - (( grid computing matching algorithm ) OR ( java implication based algorithm ))
Search alternatives:
- implication based »
- java implication »
- matching »
-
1
Bee foraging behaviour techniques for grid scheduling problem
Published 2013“…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.These resources are collected together to make a huge computing power.Job scheduling problem is one of the key issues in grid computing and failing to look into grid scheduling results in uncompleted view of the grid computing.Achieving optimized performance of grid system, and matching application requirements with available computing resources, are the objectives of grid job scheduling.Bee colony approaches are more adaptive to grid scheduling due to high heterogeneous and dynamic nature of resources and applications in grid.These algorithms have shown encouraging results in terms of time and cost.This paper presents some resent research activities inspired by bee foraging behavior for grid job scheduling especially ABC and BCO approaches.Different original studies related to this area are briefly described along with their comparisons against them and results.The review summary of their derived algorithms and research efforts is done.…”
Get full text
Get full text
Get full text
Article -
2
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
Get full text
Get full text
Get full text
Thesis -
3
Survey on job scheduling mechanisms in grid environment
Published 2015“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
Get full text
Get full text
Article -
4
Scalable Self-Organizing Model for Grid Resource Discovery
Published 2008Get full text
Get full text
Conference or Workshop Item -
5
Semantic-Based Scalable Decentralized Grid Resource Discovery
Published 2009Get full text
Get full text
Conference or Workshop Item -
6
Semantic-Based Scalable Decentralized Resource Discovery
Published 2010Get full text
Get full text
Conference or Workshop Item -
7
-
8
-
9
A robust, scalable multi-robot control and coordination framework achieving high throughput for parcel sorting centers
Published 2025“…Unlike traditional approaches, it employs a dynamic iterative allocation method that handles uncertainties and optimizes plans in real time, significantly reducing computational demands. Due to its assumption of a non perfect environment, unlike traditional algorithms, the framework is easier to implement. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
10
-
11
An integrated reservoir modelling and evolutionary algorithm for optimizing field development in a mature fractured reservoir
Published 2016“…Examining two different optimization approaches used in this work, the genetic algorithm program gave results similar to the results that were obtained by an exhaustive method with much less computation time which is a great issue mainly for large size fields or fields which possess condensate gas and require the use of compositional simulators. …”
Get full text
Get full text
Conference or Workshop Item -
12
Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method
Published 2024thesis::doctoral thesis -
13
Performance evaluation and prediction analysis of a novel catalytic combustion heating technology in an open cold emergency environment / Qin Mingyuan
Published 2024“…Five machine learning algorithms were compared to construct predictive models. …”
Get full text
Get full text
Get full text
Thesis
