Skip to main content
SpringerLink
Log in

Multisite co-allocation scheduling algorithms for parallel jobs in computing grid environments

  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

Cooperation of multi-domain massively parallel processor systems in computing grid environment provides new opportunities for multisite job scheduling. At the same time, in the area of co-allocation, heterogeneity, network adaptability and scalability raise the challenge for the international design of multisite job scheduling models and algorithms. It presents multisite job scheduling schema through the introduction of multisite job scheduling model and the performance model under the grid environment. It introduces two job multisite and cooperative scheduling models and algorithms with the core of the optimal and greedy-heuristic resource selection strategies. Meanwhile, compared with single and multisite cooperative scheduling models and algorithms introduced by Sabin, Yahyapour and other persons, the validity and advance of the scheduling model and the performance model herein are proved.

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. Foster I. The Grid: A new infrastructure for 21st century science. Physics Today, 2002, 55(2): 42–47

    Google Scholar 

  2. Foster I, Kesselman C. The Grid: Blueprint for a New Computing Infrastructure. 2nd ed. San Fransisco, CA: Morgan Kaufmann, 1999. 279–290

    Google Scholar 

  3. Sabin G, Kettimuthu R, Rajan A, et al. Scheduling of parallel jobs in a heterogeneous multisite environment. In: Feitelson D G, Rudolph L, Schwiegelshohn U, eds. Job Scheduling Strategies for Parallel Processing. Lect. Notes in Comput. Sci, Vol. 2862. Berlin: Springer-Verlag, 2003. 87–104

    Chapter  Google Scholar 

  4. Feitelson D G. A Survey of Scheduling in Multiprogrammed Parallel Systems. IBM Watson T J Research Center Technical Report RC 19790(87657). 1994

  5. Feitelson D G, Rudolph L. Parallel job scheduling: Issues and approaches. In: Feitelson D G, Rudolph L, eds. Job Scheduling Strategies for Parallel Processing. Lect. Notes in Comput. Sci, Vol. 949. Berlin: Springer-Verlag, 1995. 1–18

    Google Scholar 

  6. Feitelson D G, Rudolph L, Schwiegelshohn U. Parallel job scheduling—a status report. In: Feitelson D G, Rudolph L, Schwiegelshohn U, eds. Job Scheduling Strategies for Parallel Processing. Lect. Notes in Comput. Sci, Vol. 3277. Berlin: Springer-Verlag, 2004, 1–16

    Google Scholar 

  7. Abawajy J H, Dandamudi S P. Parallel job scheduling on multicluster computing systems. In: Proceedings of IEEE International Conference on Cluster Computing (CLUSTER’03). Oakland: IEEE Computer Press, 2003. 11–18

    Chapter  Google Scholar 

  8. Sabin G, Kettimuthu R, Rajan A, et al. Scheduling of parallel jobs in a heterogeneous multisite environment. In: Feitelson D G, Rudolph L, Schwiegelshohn U, eds. Job Scheduling Strategies for Parallel Processing. Berlin: Springer-Verlag, 2003. 87–104

    Chapter  Google Scholar 

  9. Ernemann C, Hamscher V, Yahyapour R. Benefits of global grid computing for job scheduling. In: Proceedings of 5th IEEE/ACM International Workshop on Grid Computing in Conjunction with SuperComputing 2004. Oakland: IEEE Computer Press, 2004. 374–379

    Google Scholar 

  10. England D, Weissman J B. Costs and benefits of load sharing in the computational grid. In: Feitelson D G, Rudolph L, Schwiegelshohn U, eds. Job Scheduling Strategies for Parallel Processing. Lect. Notes in Comput. Sci, Vol. 3277. Berlin: Springer-Verlag, 2004. 160–175

    Google Scholar 

  11. Martino V D, Mililotti M. Sub optimal scheduling in a grid using genetic algorithms. Parallel Computing, 2004, 30(5–6): 553–565

    Article  Google Scholar 

  12. Gao Y, Huang J Z, Rong H. Adaptive grid job scheduling with genetic algorithm. Future Generation Computer System, 2005, 21: 151–161

    Article  Google Scholar 

  13. Hamscher V, Schwiegelshohn U, Streit A, et al. Evaluation of job-scheduling strategies. In: Proceedings of Grid Computing (Grid 2000) at 7th International Conference on High Performance Computing (HiPC-2000). Lect. Notes in Comput. Sci, Vol. 1971. Berlin: Springer-Verlag, 2004. 191–202

    Google Scholar 

  14. Ernemann C. Hamscher V, Schwiegelshohn U, et al. On advantages of grid computing for parallel job scheduling. In: Proceedings of 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2002). Oakland: IEEE Computer Press, 2002. 39–47

    Chapter  Google Scholar 

  15. Ernemann C, Hamscher V, Streit A, et al. Enhanced algorithms for multisite scheduling. In: Proc. 3rd IEEE/ACM International Workshop on Grid Computing (Grid 2002) at Supercomputing 2002. Lect. Notes in Comput. Sci, Vol. 2536. Berlin: Springer-Verlag, 2002. 219–231

    Google Scholar 

  16. Ernemann C, Hamscher V, Streit A, et al. On effects of machine configurations on parallel job scheduling in computational grids. In: International Conference on Architecture of Computing Systems, ARCS, VDE, Karlsruhe, 2002. 169–179

  17. Banen S, Bucur A, Epema D. A measurement-based simulation study of processor co-allocation in multicluster systems. In: Feitelson D G, Rudolph L, Schwiegelshohn U, eds. Job Scheduling Strategies for Parallel Processing. Lect. Notes in Comput. Sci, Vol. 2862. Berlin: Springer-Verlag, 2003. 105–128

    Chapter  Google Scholar 

  18. Sinaga J, Mohamed H, Epema D. A dynamic co-allocation service in multicluster systems. In: Feitelson D G, Rudolph L, Schwiegelshohn U, eds. Job Scheduling Strategies for Parallel Processing. Lect. Notes in Comput. Sci, Vol. 3277. Berlin: Springer-Verlag, 2005. 194–209

    Google Scholar 

  19. Mohamed H, Epema D. The design and implementation of the KOALA co-allocating grid scheduler. In: Proc. European Grid Conference. Lect. Notes in Comput. Sci, Vol. 3470, Berlin: Springer-Verlag, 2005. 640–650

    Google Scholar 

  20. Bucur A, Epema D. Priorities among multiple queues for processor co-allocation in multicluster systems. In: Proc. 36th Annual Simulation Symp, Orlando. Oakland: IEEE Computer Press, 2003. 15–27

    Google Scholar 

  21. Bucur A, Epema D. The maximal utilization of processor co-allocation in multicluster systems. In: Proc. 17th International Parallel and Distributed Processing Symposium (IPDPS 2003). Oakland: IEEE Computer Press, 2003. 60–69

    Google Scholar 

  22. Bucur A, Epema D. The performance of processor co-allocation in multicluster systems. In: Proc. 3rd IEEE/ACM Int’l Symp. on Cluster Computing and the Grid (CCGrid2003). Oakland: IEEE Computer Press, 2003. 302–309

    Chapter  Google Scholar 

  23. Bucur A, Epema D. Trace-based simulations of processor co-allocation policies in multiclusters. In: Proc. 12th IEEE Int’s Symp. On High Performance Distributed Computing (HPDC-12). Oakland: IEEE Computer Press, 2003. 70–79

    Chapter  Google Scholar 

  24. Bucur A, Epema D. The influence of the structure and sizes of jobs on the performance of co-allocation. In: Proc. 6th Workshop on Job Scheduling Strategies for Parallel Processing, Lect. Notes in Comput. Sci, Vol. 1911. Berlin: Springer-Verlag, 2000. 154–173

    Google Scholar 

  25. Bucur A, Epema D. The influence of communication on the performance of co-allocation. In: Feitelson D, Rudolph L, eds. Proc. 7th Workshop on Job Scheduling Strategies for Parallel Processing. Lect. Notes in Comput. Sci, Vol. 2221. Berlin: Springer-Verlag, 2001. 66–86

    Google Scholar 

  26. Bucur A, Epema D. Local versus global queues with processor co-allocation in multicluster systems. In: Feitelson D, Rudolph L, Schwiegelshohn U, eds. Job Scheduling Strategies for Parallel Processing, Lect. Notes in Comput. Sci, Vol. 2537. Berlin: Springer-Verlag, 2002. 184–204.

    Google Scholar 

  27. Goldman A, Queiroz C. A model for parallel job scheduling on dynamical computer grids. Concurrency and Computation: Practice and Experience, 2004, 16(5): 461–468

    Article  Google Scholar 

  28. Snell Q, Clement M, Jackson D, et al. The performance impact of advance reservation meta-scheduling. In: Feitelson D G, Rudolph L, Schwiegelshohn U, eds. Job Scheduling Strategies for Parallel Processing. Lect. Notes in Comput. Sci, Vol. 1911. Berlin: Springer-Verlag, 2000. 137–153

    Google Scholar 

  29. Schwiegelshohn U, Yahyapour R. Fairness in parallel job scheduling. Journal of Scheduling, 2000, 3(5): 297–320

    Article  MathSciNet  Google Scholar 

  30. Jones J, Nitzberg B. Scheduling for parallel supercomputing: a historical perspective of achievable utilization. In: Proc. 5th Workshop on Job Scheduling Strategies for Parallel Processing, Lect. Notes in Comput. Sci, Vol. 1659. Berlin: Springer-Verlag, 1999. 1–16

    Google Scholar 

  31. Skovira J, Chan W, Zhou H, et al. The EASY-loadleveller api project. In: Proc. 2nd Workshop on Job Scheduling Strategies for Parallel Processing. Lect. Notes in Comput. Sci, Vol. 1162. Berlin: Springer-Verlag, 1999. 41–47

    Chapter  Google Scholar 

  32. Feitelson D, Rudolph L, Schweigelshohn U, et al. Theory and practice in parallel job scheduling. In: Proc. 3rd Workshop on Job Scheduling Strategies for Parallel Processing, Lect. Notes in Comput. Sci, Vol. 1291. Berlin: Springer-Verlag, 1999. 1–34

    Google Scholar 

  33. Sodhi S, Subhlok J. Skeleton based performance predielshohn U, et al. Theory and practice in parallel job scheduling. In: Proc. 3rd Workshop on Job Scheduling Strategies for Parallel Processing, Lect. Notes in Comput. Sci, Vol. 1291. Berlin: Springer-Verlag, 1999. 1–34

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Harbin Institute of Technology, Harbin, 150001, China

    Zhang Weizhe, Fang Binxing, Hu Mingzeng, Zhang Hongli & Gao Lei

  2. National Computer Network Emergency Response Technical Team/Coordination Center of China, Beijing, 100029, China

    Fang Binxing & Liu Xinran

  3. Beijing University of Posts and Telecommunications, Beijing, 100876, China

    Liu Xinran

Authors
  1. Zhang Weizhe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fang Binxing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hu Mingzeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Liu Xinran
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zhang Hongli
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Gao Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhang Weizhe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, W., Fang, B., Hu, M. et al. Multisite co-allocation scheduling algorithms for parallel jobs in computing grid environments. SCI CHINA SER F 49, 906–926 (2006). https://doi.org/10.1007/s11432-006-2034-2

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-006-2034-2

Keywords

Search

Navigation