Skip to main content

Experiments with Scheduling Using Simulated Annealing in a Grid Environment

  • Conference paper
  • First Online:

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

Abstract

Generating high quality schedules for distributed applications on a Computational Grid is a challenging problem. Some experiments using Simulated Annealing as a scheduling mechanism for a ScaLAPACK LU solver on a Grid are described. The Simulated Annealing scheduler is compared to a Ad-Hoc Greedy scheduler used in earlier experiments. The Simulated Annealing scheduler exposes some assumptions built into the Ad-Hoc scheduler and some problems with the Performance Model being used.

This work is supported in part by the National Science Foundation contract GRANT #E81-9975020, SC R36505-29200099, R011030-09, “Next Generation Software: Grid Application Development Software (GrADS)”.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Francine Berman. High-performance schedulers. In Ian Foster and Carl Kesselman, editors, The Grid: Blueprint for a New Computing Infrastructure, pages 279–309. Morgan Kaufmann, San Francisco, CA, 1999.

    Google Scholar 

  2. Francine Berman, Andrew Chien, Keith Cooper, Jack Dongarra, Ian Foster, Dennis Gannon, Lennart Johnsson, Ken Kennedy, Carl Kesselman, John Mellor-Crummey, Dan Reed, Linda Torczon, and Rich Wolski. The GrADS Project: Software support for high-level Grid application development. The International Journal of High Performance Computing Applications, 15(4):327–344, November 2001.

    Article  Google Scholar 

  3. L. S. Blackford, J. Choi, A. Cleary, E. D’Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley. ScaLAPACK: a linear algebra library for message-passing computers. In Proceedings of the Eighth SIAMConfer ence on Parallel Processing for Scientific Computing (Minneapolis, MN, 1997), page 15 (electronic), Philadelphia, PA, USA, 1997. Society for Industrial and Applied Mathematics.

    Google Scholar 

  4. Henri Casanova. Simgrid: A Toolkit for the Simulation of Application Scheduling. In Proceedings of the First IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2001), Brisbane, Australia, May 15–18 2001.

    Google Scholar 

  5. Holly Dail. A Modular Framework for Adaptive Scheduling in Grid Application Development Environments. Master’s thesis, University of California, San Diego, 2002.

    Google Scholar 

  6. I. Foster and C. Kesselman. Globus: A Metacomputing Infrastructure Toolkit. The International Journal of Supercomputer Applications and High Performance Computing, 11(2):115–128, Summer 1997.

    Article  Google Scholar 

  7. Ian Foster and Carl Kesselman. The Globus Toolkit. In Ian Foster and Carl Kesselman, editors, The Grid: Blueprint for a New Computing Infrastructure, pages 259–278. Morgan Kaufmann, San Francisco, CA, 1999. Chap. 11.

    Google Scholar 

  8. Andrew S. Grimshaw, William A. Wulf, and the Legion team. The Legion Vision of a Worldwide Virtual Computer. Communications of the ACM, 40(1):39–45, January 1997.

    Article  Google Scholar 

  9. Scott Kirkpatrick. Optimization by Simulated Annealing: Quantitative Studies. Journal of Statistical Physics, 34(5–6):975–986, 1984.

    Article  MathSciNet  Google Scholar 

  10. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equations of state calculations by fast computing machines. J. Chem. Phys., 21:1087–1091, 1953.

    Article  Google Scholar 

  11. Antoine Petitet, Susan Blackford, Jack Dongarra, Brett Ellis, Graham Fagg, Kenneth Roche, and Sathish Vadhiyar. Numerical libraries and the Grid. The International Journal of High Performance Computing Applications, 15(4):359–374, November 2001.

    Article  Google Scholar 

  12. Tindell, Burns, and Wellings. Allocating hard real-time tasks: An NP-hard problem made easy. RTSYSTS: Real-Time Systems, 4, 1992.

    Google Scholar 

  13. J Ullman. NP-Complete Scheduling Problems. Journal of Computer and System Sciences, 10:384–393, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  14. Rich Wolski, Neil T. Spring, and Jim Hayes. The Network Weather Service: a Distributed Resource Performance Forecasting Service for Metacomputing. Future Generation Computer Systems, 15(5–6):757–768, October 1999.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

YarKhan, A., Dongarra, J.J. (2002). Experiments with Scheduling Using Simulated Annealing in a Grid Environment. In: Parashar, M. (eds) Grid Computing — GRID 2002. GRID 2002. Lecture Notes in Computer Science, vol 2536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36133-2_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-36133-2_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00133-1

  • Online ISBN: 978-3-540-36133-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics