Availability-based noncontiguous processor allocation policies for 2D mesh-connected multicomputers
Journal of Systems and Software
One-dimensional partitioning for heterogeneous systems: Theory and practice
Journal of Parallel and Distributed Computing
Routing-contained virtualization based on Up*/Down* forwarding
HiPC'07 Proceedings of the 14th international conference on High performance computing
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
Computational Geometry: Theory and Applications
Scalable node allocation for improved performance in regular and anisotropic 3D torus supercomputers
EuroMPI'11 Proceedings of the 18th European MPI Users' Group conference on Recent advances in the message passing interface
Communication-aware processor allocation for supercomputers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Improvements to the structural simulation toolkit
Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
Approximate covering detection among content-based subscriptions using space filling curves
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
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-filling 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 1 at Sandia by May 2002.