Open Access
Simple Scheduling Algorithm with Load Balancing for Grid Computing
Fahd Alharbi
- 01 Jan 2012
28
TL;DR: A Simple Scheduling Algorithm with Load Balancing (SSALB) is proposed, which minimizes the makespan and balances the load with a low computational complexity.
read more
Abstract: Grid computing provides the means of using and sharing heterogeneous resources that are geographically distributed to solve complex scientific or technical problems. Task scheduling is critical to achieving high performance on grid computing environment. The objective of the scheduling process is to map each task with specific requirements to a capable machine in order to minimize the makespan. Task scheduling is shown to be NP-complete problem, which can be solved using heuristic algorithms. Several heuristic algorithms have been proposed in the literature and they are either not efficient or complex. In this paper, we are proposing a Simple Scheduling Algorithm with Load Balancing (SSALB), which minimizes the makespan and balances the load with a low computational complexity.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Load balancing in cloud computing: A big picture
TL;DR: A taxonomy for the load balancing algorithms in the cloud is presented and a brief explanation of considered performance parameters in the literature and their effects is presented in this paper.
359
Hybridization of meta-heuristic algorithm for load balancing in cloud computing environment
TL;DR: The robustness of the algorithm has been validated by comparing the results of the QMPSO obtained from the simulation process with the existing load balancing and scheduling algorithm and the comparison of the simulation and real platform result shows the proposed algorithm is outperforming its competitor.
153
Multi objective task scheduling algorithm based on SLA and processing time suitable for cloud environment
TL;DR: The comparison analysis among various existing algorithms with TBTS and SLA-LB algorithms show that the proposed methods outperform existing algorithms, even in the scalability situation of the dataset and virtual machines.
67
Scheduling Algorithms for Heterogeneous Cloud Environment: Main Resource Load Balancing Algorithm and Time Balancing Algorithm
TL;DR: Two IoT-aware multi-resource task scheduling algorithms for heterogeneous cloud environment namely main resource load balancing and time balancing are proposed to obtain better result of load balance, Service-Level Agreement (SLA) and IoT task response time and meanwhile to reduce the energy consumption as much as possible.
57
Task Scheduling in Distributed Systems Using Heap Intelligent Discrete Particle Swarm Optimization
S. Sarathambekai,K. Umamaheswari +1 more
- 01 Nov 2017
TL;DR: Computational simulation results indicate that the performance of DPSO algorithm has shown significant improvement with binary heap tree topology used for communication among the particles in the swarm.
23
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems
TL;DR: Three new heuristics, one for batch mode and two for immediate mode, are introduced as part of this research, revealing that the choice of which dynamic mapping heuristic to use in a given heterogeneous environment depends on parameters such as the structure of the heterogeneity among tasks and machines and the arrival rate of the tasks.
886
A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems
Tracy D. Braun,H.J. Siegal,N.B. Beck,Ladislau Bölöni,Muthucumaru Maheswaran,Albert Reuther,J.P. Robertson,Mitchell D. Theys,Bin Yao,Debra Hensgen,Richard F. Freund +10 more
- 12 Apr 1999
TL;DR: A collection of eleven heuristics from the literature has been selected, implemented, and analyzed under one set of common assumptions and provides one even basis for comparison and insights into circumstances where one technique will outperform another.
273
The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions
R. Armstrong,D. Hensgen,T. Kidd +2 more
- 30 Mar 1998
TL;DR: The author studies the performance of four mapping algorithms and concludes that the use of intelligent mapping algorithms is beneficial, even when the expected time for completion of a job is not deterministic.
269