Journal of Parallel and Distributed Computing
Performance analysis of job scheduling policies in parallel supercomputing environments
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Job Scheduling is More Important than Processor Allocation for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Job Scheduling in Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Designing Tree-Based Barrier Synchronization on 2D Mesh Networks
IEEE Transactions on Parallel and Distributed Systems
Impact of job mix on optimizations for space sharing schedulers
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Good Processor Management = Fast Allocation + Efficient Scheduling
ICPP '97 Proceedings of the international Conference on Parallel Processing
An Integrated Processor Management Scheme for the Mesh-Connected Multicomputer Systems
ICPP '97 Proceedings of the international Conference on Parallel Processing
The Effects of Network Contention on Processor Allocation Strategies
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Processor Allocation in the Mesh Multiprocessors Using the Leapfrog Method
IEEE Transactions on Parallel and Distributed Systems
Largest-job-first-scan-all scheduling policy for 2D mesh-connected systems
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Modeling the Effects of Contention on the Performance of Heterogeneous Applications
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Finding Maximal Submeshes in Faulty 2D Mesh in the Presence of Failed Nodes
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Multitoroidal Interconnects For Tightly Coupled Supercomputers
IEEE Transactions on Parallel and Distributed Systems
Run-time task allocation considering user behavior in embedded multiprocessor networks-on-chip
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Pitfalls in parallel job scheduling evaluation
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
| Hi-index | 0.00 |
Current processor allocation techniques for highly parallel systems have thus far been restricted to contiguous allocation strategies for which performance suffers significantly due to the inherent problem of fragmentation. We are investigating processor allocation algorithms which lift the restriction on contiguity of processors in order to address the problem of fragmentation. Three non-contiguous processor allocation strategies: Naive, Random and the Multiple Buddy Strategy (MBS) are proposed and studied in this paper. Simulations compare the performance of the non-contiguous strategies with that of several well-known contiguous algorithms. We show that non-contiguous allocation algorithms perform better overall than the contiguous ones, even when message-passing contention is considered. We also present the results of experiments on an Intel Paragon XP/S-15 with 208 nodes that show non-contiguous allocation is feasible with current technologies.