Abstract
Efficient task scheduling is critical to achieving high performance on grid computing environment. The task scheduling on grid is studied as optimization problem in this paper. A heuristic task scheduling algorithm satisfying resources load balancing on grid environment is presented. The algorithm schedules tasks by employing mean load based on task predictive execution time as heuristic information to obtain an initial scheduling strategy. Then an optimal scheduling strategy is achieved by selecting two machines satisfying condition to change their loads via reassigning their tasks under the heuristic of their mean load. Methods of selecting machines and tasks are given in this paper to increase the throughput of the system and reduce the total waiting time. The efficiency of the algorithm is analyzed and the performance of the proposed algorithm is evaluated via extensive simulation experiments. Experimental results show that the heuristic algorithm performs significantly to ensure high load balancing and achieve an optimal scheduling strategy almost all the time. Furthermore, results show that our algorithm is high efficient in terms of time complexity.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Kwok Y, Ahmad I. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel and Distributed Systems, 1996, 7(5): 506–521.
Hou E S H, Ansari N, Ren H. A genetic algorithm for multiprocessor scheduling. IEEE Trans. Parallel and Distributed Systems, 1994, 5(2): 113–120.
Sih G C, Lee E A. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. Parallel and Distributed Systems, 1993, 4(2): 175–186.
Singh H, Youssef A. Mapping and scheduling heterogeneous task graphs using genetic algorithms. In Proc. 5th IEEE Int. Heterogeneous Computing Workshop, Honolulu, Hawaiian Islands, April 15-16, 1996, pp.86–97.
Ahmad I, Kwok Y. A new approach to scheduling parallel programs using task duplication. In Proc. 4th Int. Parallel Processing, Chapel Hills, North Carolina, August 15-19, 1994, pp.47–51.
Palis M A, Liou J, Wei D S L. Task clustering and scheduling for distributed memory parallel architectures. IEEE Trans. Parallel and Distributed Systems, 1996, 7(1): 46–55.
Zhuge H. Semantic grid: Scientific issues, infrastructure, and methodology. Communications of the ACM, 2005, 48(4): 117–119.
Zhuge H, Sun X, Liu J et al. A scalable P2P platform for the knowledge grid. IEEE Trans. Knowledge and Data Engineering, 2005, 17(12): 1721–1736.
Cannataro M, Talia D. Semantics and knowledge grids: Building the next-generation grid. IEEE Trans. Intelligent Systems, 2004, 19(1): 56–63.
Thain D, Tannenbaum T, Livny M. Condor and the Grid. Grid Computing: Making The Global Infrastructure a Reality, Hey A J G, Berman F, Fox G C (eds.), Wiley, West Sussex, England, 2003, pp.299–335.
Krauter K, Buyya R, Maheswaran M. A taxonomy and survey of grid resource management systems for distributed computing. Software Practice and Experience, 2002, 32(1): 135–164.
Ibarra O H, Kim C E. Heuristic algorithms for scheduling independent tasks on non-identical processors. Journal of the Association for Computing Machinery, 1997, 24(2): 280–289.
Taura K, Chien A. A heuristic algorithm for mapping communicating tasks on heterogeneous resources. In Proc. 9th Int. Heterogeneous Computing Workshop, Cancun, Mexico, May 1–5, 2000, pp.102–115.
Sun X H, Wu M. Grid harvest service: A system for long-term, application-level task scheduling. In Proc. 17th IEEE Int. Parallel and Distributed Processing Symp., Nice, France, April 22–26, 2003, pp.363–370.
Allen D. Predicting queue times on space-sharing parallel computers. In Proc. 11th Int. Parallel Processing Symp., Geneva, Switzerland, April 1–5, 1997, pp.209–218.
Richard G. A historical application profiler for use by parallel schedulers. Lecture Notes on Computer Science, 1997, 1291: 58–77.
Smith W, Ian F, Valerie T. Predicting application run times using historical information. Lecture Notes in Computer Science, 1998, 1459: 122–142.
Miller B P, Tamches A. Fine-grained dynamic instrumentation of commodity operating system kernels. In Proc. 3rd Int. Operating Systems Design and Implementation Symp., New Orleans, LA, February 22–25, 1999, pp.117–130.
Dinda P, O'Hallaron D. An Extensible Toolkit for Resource Prediction in Distributed Systems. Technical Report CMU-CS-99-138, School of Computer Science, Carnegie Mellon University, July, 1999.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ni, LN., Zhang, JQ., Yan, CG. et al. A Heuristic Algorithm for Task Scheduling Based on Mean Load on Grid. J Comput Sci Technol 21, 559–564 (2006). https://doi.org/10.1007/s11390-006-0559-x
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11390-006-0559-x