Skip to main content
SpringerLink
Log in

A Scheduling Model for Grid Computing Systems

  • Conference paper
  • First Online:
Grid Computing — GRID 2001 (GRID 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2242))

Included in the following conference series:

Abstract

Application-level scheduling in Grid Computing systems is an extensively researched field. The past decade has seen many different techniques and algorithms emerge to tackle this research problem. In this paper we present results of our preliminary studies of an innovative approach to scheduling. This algorithm utilizes a collective, event-based and decentralized (gridCoED) strategy on a metacomputing level to allocate jobs to a set of nodes in a grid environment. We present the design of the model and appropriate simulation results. We also highlight some of the salient features of our model that makes it suitable for application-level scheduling in grid computing systems.

In this paper, a node refers to a processor, workstation, or a computing machine in a grid environment and the terms are used interchangeably. Also, the terms, jobs and processes are used interchangeably to indicate computation-intensive applications.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Ahmed and Y. K. Kwok, “A new approach to scheduling parallel programs using task duplication”, Proceedings of the International Conference on Parallel Processing, Vol. 2. (1994) 47–51

    Google Scholar 

  2. Eager et al. “Adaptive Load Sharing in Homogenous Distributed Systems”, IEEE Transactions on Software Engineering, Vol. 12. (1986) 662–675

    Article  Google Scholar 

  3. H. El-Rewini and T.G. Lewis, “Scheduling parallel programs onto arbitrary target architectures”, Journal of Parallel and Distributed Computing, Vol. 9, No. 2. (1990) 138–153

    Article  Google Scholar 

  4. A. Gerasoulis and T. Yang, “A comparison of clustering heuristics for scheduling directed acyclic graphs onto multiprocessors”, Journal of Parallel and Distributed Computing, Vol. 16, No. 4. (1992) 276–291

    Article  MathSciNet  Google Scholar 

  5. Volker Hamscher, Uwe Schwiegelshohn, Achim Streit, and Ramin Yahyapour, “Evaluation of Job-Scheduling Strategies for Grid Computing”, Proceedings of the First IEEE/ACM International Workshop on Grid Computing—GRID 2000. (2000) 191–202

    Google Scholar 

  6. Elisa Heymann, Miquel A. Senar, Emilio Luque, and Miron Livny, “Adaptive Scheduling for Master-Worker Applications on the Computational Grid”, Proceedings of the First IEEE/ACM International Workshop on Grid Computing—GRID 2000. (2000) 214–227

    Google Scholar 

  7. J. J. Hwang, Y.C. Chow, F.D. Anger, C.Y. Lee, “Scheduling precedence graphs in systems with inter processor communication times”, SIAM Journal of Computing, Vol.18, No. 2. (1989) 244–257

    Article  Google Scholar 

  8. R. Lüling, B. Monien, F. Ramme, “Load Balancing in Large Networks: A Comparative Study”, 3rd IEEE Symposium on Parallel and Distributed Processing (1991)

    Google Scholar 

  9. Muthucumaru Maheswaran and Klaus Krauter, “A Parameter-Based Approach to Resource Discovery in Grid Computing Systems”, Proceedings of the First IEEE/ACM International Workshop on Grid Computing—GRID 2000. (2000) 181–190

    Google Scholar 

  10. Michael Mitzenmacher, “How Useful is Old Information?” IEEE Transactions on Parallel and Distributed Systems, Vol. 11, No. 1. (2000) 6–20

    Article  Google Scholar 

  11. J. Mullender, “Process Management in a Distributed Operating System”, Lecture Notes in Computer Sciences-Experiences with Distributed Systems, J. Nehmer (Editor). Vol.309, International Workshop Kaiserslautern. (1987)

    Google Scholar 

  12. L. M. Ni, C. W. Xu, T. B. Gendreau, “Drafting Algorithm—A Dynamic Process Migration Protocol for Distributed Systems”, IEEE 5th Int. Conf. on Distributed Computing Systems. (1985) 539–546

    Google Scholar 

  13. S. S. Pande, D. P. Agrawal and J. Mauney, “A new threshold scheduling strategy for Sisal programs on distributed memory systems”, Journal of Parallel and Distributed Computing, Vol. 21, No. 2. (1994) 223–236

    Article  Google Scholar 

  14. S. S. Pande, D. P. Agrawal and J. Mauney, “A scalable scheduling method for functional paralleleism on distributed memory multiprocessors”, IEEE Transactions of Parallel and Distributed Systems, Vol. 6, No. 4. (1995) 388–399

    Article  Google Scholar 

  15. Samantha Ranaweera and Dharma P. Agrawal, “A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems”, Proceedings of the 14th International Parallel and Distributed Processing Symposium (IPDPS’00) (2000)

    Google Scholar 

  16. Anuraag Sarangi and Alok Shriram, “Process Allocation Using ICHU Model”, paper presented as a poster in International Conference on High Performance Computing (HiPC’OO), Bangalore, India. (2000)

    Google Scholar 

  17. V. Sarkar, “Partitioning and scheduling programs for execution on multiprocessors”, MIT Press, Cambridge, MA. (1989)

    MATH  Google Scholar 

  18. Alok Shriram, Anuraag Sarangi, Avinash S. “ICHU Model for Processor Allocation in Distributed Operating Systems”, submitted to ACM SIGOPS Operating System Review.

    Google Scholar 

  19. Johnathan M. Smith and Gerald Q. Maguire, Jr., “Process Migration: Effects on Scientific Computation”, ACM SIGPLAN Notices 23930. (1988) 102–106

    Google Scholar 

  20. Andrew S. Tanenbaum, Modern Operating Systems. Prentice-Hall N.J, U.S. 1992

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering, Sri Venkateswara College of Engineering, Post Bag No.3, 602105, Pennalur, Sriperumbudur, Tamil Nadu, India

    Anuraag Sarangi, Alok Shriram & Avinash Shankar

Authors
  1. Anuraag Sarangi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alok Shriram
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Avinash Shankar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. High Performance Computing, The Aerospace Corp., 2350 East El Segundo Blvd., 90245, El Segundo, CA, USA

    Craig A. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sarangi, A., Shriram, A., Shankar, A. (2001). A Scheduling Model for Grid Computing Systems. In: Lee, C.A. (eds) Grid Computing — GRID 2001. GRID 2001. Lecture Notes in Computer Science, vol 2242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45644-9_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-45644-9_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42949-4

  • Online ISBN: 978-3-540-45644-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation