A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm
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.
Unable to display preview. Download preview PDF.
- B. Kingsbury, H. Walter, M. Bridge and T. Carver. “NQS, Network Queuing System, Version 2.0”, Cosmic Program # ARC-13179.Google Scholar
- L. M. Ni and P. K. McKinley. “A survey of wormhole routing techniques in direct networks”. IEEE Trans. Computers, 1993.Google Scholar
- V. Lo, K. Windisch, W. Liu and B. Nitzberg. “Non-contiguous Processor Allocation Algorithm for Mesh-connected Multicomputers”, paper to be published.Google Scholar
- FTP://ftp.sdsc.edu//pub/sdsc/parallel/ paragon/paragon95.txt.ZGoogle Scholar