Skip to main content
Springer Nature Link
Log in

Local versus Global Schedulers with Processor Co-allocation in Multicluster Systems

  • Conference paper
  • First Online:
Job Scheduling Strategies for Parallel Processing (JSSPP 2002)

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

Included in the following conference series:

Abstract

In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), co-allocation, i.e., the simultaneous allocation of processors to single jobs in different clusters, may be required. We study the performance of co-allocation by means of simulations for the mean response time of jobs depending on a set of scheduling decisions such as the number of schedulers and queues in the system, the way jobs with different numbers of components are distributed among these queues and the priorities imposed on the schedulers, and on the composition of the job stream.

In this paper, ASCI refers to the Advanced School for Computing and Imaging in The Netherlands, which came into existence before, and is unrelated to, the US Accelerated Strategic Computing Initiative.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

ferences

  1. K. Aida, H. Kasahara, and S. Narita. Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs. In D. G. Feitelson and L. Rudolph, editors, 4th Workshop on Job Scheduling Strategies for Parallel Processing, volume 1459 of LNCS, pages 98–121. Springer-Verlag, 1998. 184

    Google Scholar 

  2. H. E. Bal, A. Plaat, M. G. Bakker, P. Dozy, and R. F. H. Hofman. Optimizing Parallel Applications for Wide-Area Clusters. In Proc. of the 12th International Parallel Processing Symposium, pages 784–790, 1998. 185

    Google Scholar 

  3. A. I. D. Bucur and D. H. J. Epema. The Influence of the Structure and Sizes of Jobs on the Performance of Co-allocation. In D. G. Feitelson and L. Rudolph, editors, 6th Workshop on Job Scheduling Strategies for Parallel Processing, volume 1911 of LNCS, pages 154–173. Springer-Verlag, 2000. 197

    Google Scholar 

  4. A. I. D. Bucur and D. H. J. Epema. The Influence of Communication on the Performance of Co-allocation. In D. G. Feitelson and L. Rudolph, editors, 7th Workshop on Job Scheduling Strategies for Parallel Processing, volume 2221 of LNCS, pages 66–86. Springer-Verlag, 2001. 197

    Google Scholar 

  5. K. Czajkowski, I. Foster, and C. Kesselman. Resource Co-Allocation in Computational Grids. In 8th IEEE Int’l Symp. on High Perf. Distrib. Comp., pages 219–228, 1999. 184

    Google Scholar 

  6. C. Ernemann, V. Hamscher, U. Schwiegelshohn, and R. Yahyapour. On Advantages of Grid Computing for Parallel Job Scheduling. In 2th IEEE/ACM Int’l Symp. on Cluster Computing and the Grid, pages 39–46, 2002. 197

    Google Scholar 

  7. H. E. Bal et al. The Distributed ASCI Supercomputer Project. ACM Operating Systems Review, 34(4):76–96, 2000. 185

    Article  Google Scholar 

  8. D. G. Feitelson and L. Rudolph. Theory and Practice in Parallel Job Scheduling. In D. G. Feitelson and L. Rudolph, editors, 3rd Workshop on Job Scheduling Strategies for Parallel Processing, volume 1291, pages 1–34. Springer-Verlag, 1997. 188

    Google Scholar 

  9. I. Foster and C. Kesselman (eds). The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1999. 184

    Google Scholar 

  10. T. Kielmann, R. F. H. Hofman, H. E. Bal, A. Plaat, and R. A. F. Bhoedjang. Mag-PIe: MPI’s Collective Communication Operations for Clustered Wide Area Systems. In ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, pages 131–140, 1999. 185

    Google Scholar 

  11. W. Leinberger, G. Karypis, and V. Kumar. Multi-capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints. In Int’l Conf. on Parallel Processing, pages 404–412, 1999. 198

    Google Scholar 

  12. Mesquite Software, Inc. The CSIM18 Simulation Engine, User’s Guide. 191

    Google Scholar 

  13. K. J. Omahen. Capacity Bounds for Multiresource Queues. J. of the ACM, 24:646–663, 1977. 197

    Article  MATH  MathSciNet  Google Scholar 

  14. A. Plaat, H. E. Bal, R. F. H. Hofman, and T. Kielmann. Sensitivity of Parallel Applications to Large Differences in Bandwidth and Latency in Two-Layer Interconnects. Future Generation Computer Systems, 17:769–782, 2001. 185

    Article  MATH  Google Scholar 

  15. Q. Snell, M. Clement, D. Jackson, and C. Gregory. The Performance Impact of Advance Reservation Meta-Scheduling. In D. G. Feitelson and L. Rudolph, editors, 6th Workshop on Job Scheduling Strategies for Parallel Processing, volume 1911 of LNCS, pages 137–153. Springer-Verlag, 2000. 197

    Google Scholar 

  16. S. Zhou and T. Brecht. Processor Pool-Based Scheduling for Large-Scale NUMA Multiprocessors. In ACM Sigmetrics’ 91, pages 133–142, 1991. 198

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Technology and Systems, Delft University of Technology, P.O. Box 5031, 2600, Delft, GA, The Netherlands

    Anca I. D. Bucur & Dick H. J. Epema

Authors
  1. Anca I. D. Bucur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dick H. J. Epema
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Engineering, The Hebrew University, 91904, Jerusalem, Israel

    Dror G. Feitelson

  2. Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    Larry Rudolph

  3. Computer Engineering Institute, Universität Dortmund, 44221, Dortmund, Germany

    Uwe Schwiegelshohn

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bucur, A.I.D., Epema, D.H.J. (2002). Local versus Global Schedulers with Processor Co-allocation in Multicluster Systems. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2002. Lecture Notes in Computer Science, vol 2537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36180-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-36180-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00172-0

  • Online ISBN: 978-3-540-36180-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics