Balanced Job Scheduling Based on Ant Algorithm for Grid Network

2010 ◽  
Vol 2 (1) ◽  
pp. 34-50 ◽  
Author(s):  
Nikolaos Preve
Keyword(s):  
Grid Computing ◽  
Ant Colony Optimization ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Experimental Results ◽  
Ant Algorithm ◽  
Entire System ◽  
Grid Environment ◽  
Grid Network

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this article is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.

Balanced Job Scheduling Based on Ant Algorithm for Grid Network

2012 ◽  
pp. 13-30
Author(s):  
Nikolaos Preve
Keyword(s):  
Grid Computing ◽  
Ant Colony Optimization ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Experimental Results ◽  
Ant Algorithm ◽  
Entire System ◽  
System Load ◽  
Grid Network

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this paper is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.

Balanced Job Scheduling Based on Ant Algorithm for Grid Network

2012 ◽  
pp. 1114-1131
Author(s):  
Nikolaos Preve
Keyword(s):  
Grid Computing ◽  
Ant Colony Optimization ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Experimental Results ◽  
Ant Algorithm ◽  
Entire System ◽  
System Load ◽  
Grid Network

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this paper is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.

scholarly journals A Robust Routing Strategy for Efficient Reallocation in Multi-Grid Environment

2018 ◽  
Vol 7 (3.12) ◽  
pp. 706
Author(s):  
R Sivasubramanian ◽  
K Arthi
Keyword(s):  
Grid Computing ◽  
Experimental Results ◽  
Grid Environment ◽  
Social Affair ◽  
Robust Routing ◽  
Routing Strategy ◽  
The Social ◽  
Maximum Occupancy

Grid Computing is becoming the rising procedure in this ongoing condition. System figuring is the social affair of PC resources from various territories to accomplish a run of the mill objective. The framework can be considered as a spread structure with non-instinctive workloads that incorporate innumerable, the multi-grid environment which provides the multi-tenancy startup for the multiple inputs that is transmitted in the form of the data. The routing strategy which provides the robust reallocation in the grid environment. This paper proposes a Strategic Multi-Reallocation procedure which makes the reallocation in the multi-grid environment. We Propose the Grid-Hadlock Algorithm for the efficient reallocation in the multi-grid environment. The implementation proves the maximum occupancy and its reallocation strategies more efficient. The experimental results proves the phenomenon is more efficient.  

Taxi Intelligent Dispatch System Based on GPS

2013 ◽  
Vol 742 ◽  
pp. 463-468
Author(s):  
Zhong Min Yao ◽  
Zhao Peng Long ◽  
Qiang Li
Keyword(s):  
Mobile Phones ◽  
Time Complexity ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Experimental Results ◽  
Positioning System ◽  
Traffic Jam ◽  
Gps Positioning ◽  
Dispatch System ◽  
Intelligent Scheduling

GPS positioning system is installed in taxis and most mobile phones support GPS positioning function at present. GPS phones are used in the taxi to achieving intelligent scheduling based on this basis. The taxi intelligent dispatch system based on GPS is proposed, improve the traditional Dijkstra scheduling algorithms by setting taxi maximum reasonable scheduling range, experimental results show that improved algorithms reduce the time complexity and improve scheduling efficiency. Meanwhile the traffic jam information can be sent to the dispatch center and make scheduling algorithm more reasonable by combined with above information.

Sign in / Sign up

Export Citation Format

Share Document