Skip to main content

A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm

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

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

Included in the following conference series:

Abstract

As the system usage model for scalable parallel processors evolves from the singleuser, dedicated access model to a multi-user production environment, a versatile batch scheduler is needed to match user requirements to system resources. This paper describes the design and performance of a batch scheduler for the Intel Paragon system that addresses the issues associated with a multi-user production environment, including scheduling for heterogeneous nodes, scheduling for long-running jobs, scheduling for large jobs, prime/non-prime time modes, and node allocation schemes. The Modified 2-D Buddy system (M2DB) for non-contiguous node allocation is introduced and studied in this paper.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Kingsbury, H. Walter, M. Bridge and T. Carver. “NQS, Network Queuing System, Version 2.0”, Cosmic Program # ARC-13179.

    Google Scholar 

  2. L. M. Ni and P. K. McKinley. “A survey of wormhole routing techniques in direct networks”. IEEE Trans. Computers, 1993.

    Google Scholar 

  3. V. Lo, K. Windisch, W. Liu and B. Nitzberg. “Non-contiguous Processor Allocation Algorithm for Mesh-connected Multicomputers”, paper to be published.

    Google Scholar 

  4. K. Li and K. Cheng. “A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system”. Journal of Parallel and Distributed Computing, 12:79–83, 1991.

    Article  Google Scholar 

  5. FTP://ftp.sdsc.edu//pub/sdsc/parallel/ paragon/paragon95.txt.Z

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dror G. Feitelson Larry Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wan, M., Moore, R., Kremenek, G., Steube, K. (1996). A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1996. Lecture Notes in Computer Science, vol 1162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022287

Download citation

  • DOI: https://doi.org/10.1007/BFb0022287

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61864-5

  • Online ISBN: 978-3-540-70710-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics