Skip to main content

On the Job Distribution in Random Brokering for Computational Grids

  • Conference paper

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

Abstract

This paper analyses the way jobs are distributed in a computational grid environment where the brokering is done in such a way that each Computing Element has a probability to be chosen proportional to its number of CPUs. We give the asymptotic behaviour for several metrics (queue sizes, slowdown...), or, in some case, an approximation of this behaviour. We study the unsaturated case as well as the saturated case, in several stochastic distributions.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Berten, V., Goossens, J.: On the job distribution in random brokering for computational grids. Tech. Rep. 518, Université Libre de Bruxelles (May 2004), http://homepages.ulb.ac.be/~vberten/Papers/RandomBrokering-Full.ps

  2. Buyya, R.: High Performance Cluster Computing. In: Architectures and Systems, vol. 1, Prentice-Hall PTR, Englewood Cliffs (1999)

    Google Scholar 

  3. Ernemann, C., Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: On Advantages of Grid Computing for Parallel Job Scheduling. In: Proceedings of the 2nd IEEE International Symposium on Cluster Computing and the Grid (CC-GRID 2002) (May 2002)

    Google Scholar 

  4. Krallmann, J., Schwiegelshohn, U., Yahyapour, R.: On the design and evaluation of job scheduling algorithms. Job Scheduling Strategies for Parallel Processing, 17–42 (1999)

    Google Scholar 

  5. Nelson, R.: Probability, Stochastic Processes, and Queueing Theory. Springer, Heidelberg (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berten, V., Goossens, J. (2004). On the Job Distribution in Random Brokering for Computational Grids. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30566-8_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24128-7

  • Online ISBN: 978-3-540-30566-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics