Skip to main content

Ensemble Scheduling: Resource Co-Allocation on the Computational Grid

  • 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

This paper investigates a novel scheduling paradigm, ensemble scheduling, that can be used to schedule mixed workloads consisting of single-and multi-resource applications in Grid environments. Ensemble scheduling exploits the pattern of prior resource requests for ensemble (multi-resource) applications to dynamically partition the workload across the system resources. We show via simulation that an ensemble-aware scheduler can provide better performance both for ensemble applications and the more common single resource applications in Grid environment.

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

Access this chapter

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.

Bibliography

  1. S. Brunett et al., “Implementing Distributed Synthetic Forces Simulations in Metacomputing Environments”, Proceedings ofHCW’ 98.

    Google Scholar 

  2. M. Faerman et al., “Adaptive Performance Prediction for Distributed Data-Intensive Applications”, Proceedings of SC99, November 1999.

    Google Scholar 

  3. D. Feitelson, Parallel Workload Archive, http://www.cs.huii.ac.il/labs/parallel/workload/logs.htm. 1999.

  4. I. Foster and C. Kesselman, “Globus: A Metacomputing Infrastructure Toolkit”, international Journal of Supercomputing Applications, 11(2), 1997.

    Google Scholar 

  5. The Grid Blueprint for a New Computing Infrastructure, (I. Foster and C. Kesselman, editors), Morgan Kaufmann Publishers, 1998.

    Google Scholar 

  6. A.S. Grimshaw and W.A. Wulf, “The Legion Vision of a Worldwide Virtual Computer”, Communications of the ACM, Vol. 40(1), 1997.

    Google Scholar 

  7. P. Messina, “Distributed Supercomputing Applications”, in The Grid Blueprint for a New Computing Infrastructure, (I. Foster and C. Kesselman, editors), Morgan Kaufmann Publishers, 1998.

    Google Scholar 

  8. W. Smith, I. Foster, and V. Taylor, “Predicting Application Run Times Using Historical Information”, in Job Scheduling Strategies for Parallel Processors, D. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1998, Lect. Notes Computer Science, vol. 1459.

    Google Scholar 

  9. J. Weissman, “Scheduling Multi-Component Applications in Heterogeneous Wide-Area Networks”, Proceedings ofHCW’ 99.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weissman, J.B., Srinivasan, P. (2001). Ensemble Scheduling: Resource Co-Allocation on the Computational Grid. 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_9

Download citation

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

  • 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