Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies

LEUNG,VITUS J. ; ARKIN,ESTHER M. ; BENDER,MICHAEL A. ; BUNDE,DAVID ; JOHNSTON,JEANETTE R. ; LAL,ALOK ; MITCHELL,JOSEPH S.B. ; PHILLIPS,CYNTHIA ; SEIDEN,STEVEN S.

Sandia National Laboratories

关键词: 99 General And Miscellaneous//Mathematics, Computing, And Information Science;    Parallel Processing;    Supercomputers;    Algorithms;    Sandia National Laboratories;   

DOI  :  10.2172/800975
RP-ID  :  SAND2002-1488
RP-ID  :  AC04-94AL85000
RP-ID  :  800975

美国|英语

来源: UNT Digital Library

【 摘 要 】

The Computational Plant, or Cplant is a commodity-based supercomputer under development at Sandia National Laboratories. This paper describes resource-allocation strategies to achieve processor locality for parallel jobs in Cplant and other supercomputers. Users of Cplant and other Sandia supercomputers submit parallel jobs to a job queue. When a job is scheduled to run, it is assigned to a set of processors. To obtain maximum throughput, jobs should be allocated to localized clusters of processors to minimize communication costs and to avoid bandwidth contention caused by overlapping jobs. This paper introduces new allocation strategies and performance metrics based on space-tilling curves and one dimensional allocation strategies. These algorithms are general and simple. Preliminary simulations and Cplant experiments indicate that both space-filling curves and one-dimensional packing improve processor locality compared to the sorted free list strategy previously used on Cplant. These new allocation strategies are implemented in the new release of the Cplant System Software, Version 2.0, phased into the Cplant systems at Sandia by May 2002.