Skip to main content
SpringerLink
Log in

A Heuristic Algorithm for Task Scheduling Based on Mean Load on Grid

  • Grid & Services Computing
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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.

    Article  Google Scholar 

  2. 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.

    Article  Google Scholar 

  3. 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.

    Article  Google Scholar 

  4. 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.

  5. 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.

  6. 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.

    Article  Google Scholar 

  7. Zhuge H. Semantic grid: Scientific issues, infrastructure, and methodology. Communications of the ACM, 2005, 48(4): 117–119.

    Article  Google Scholar 

  8. 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.

    Article  Google Scholar 

  9. Cannataro M, Talia D. Semantics and knowledge grids: Building the next-generation grid. IEEE Trans. Intelligent Systems, 2004, 19(1): 56–63.

    Article  Google Scholar 

  10. 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.

    Google Scholar 

  11. 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.

    Article  MATH  Google Scholar 

  12. 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.

    MathSciNet  Google Scholar 

  13. 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.

  14. 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.

  15. 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.

  16. Richard G. A historical application profiler for use by parallel schedulers. Lecture Notes on Computer Science, 1997, 1291: 58–77.

    Google Scholar 

  17. Smith W, Ian F, Valerie T. Predicting application run times using historical information. Lecture Notes in Computer Science, 1998, 1459: 122–142.

    Article  Google Scholar 

  18. 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.

  19. 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.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Tongji University, Shanghai, 200092, P.R. China

    Li-Na Ni, Jin-Quan Zhang, Chun-Gang Yan & Chang-Jun Jiang

  2. College of Information Science & Engineering, Shandong University of Science & Technology, Qingdao, 266510, P.R. China

    Li-Na Ni & Jin-Quan Zhang

Authors
  1. Li-Na Ni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin-Quan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chun-Gang Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chang-Jun Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Li-Na Ni.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-006-0559-x

Keywords

Search

Navigation