An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead
IEEE Transactions on Parallel and Distributed Systems
Processor Scheduling and Allocation for 3D Torus Multicomputer Systems
IEEE Transactions on Parallel and Distributed Systems
Efficient Processor Allocation Scheme for Multi Dimensional Interconnection Networks
ICPP '97 Proceedings of the international Conference on Parallel Processing
An efficient submesh allocation scheme for 3D torus multicomputer systems
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Efficient Subtorus Processor Allocation in a Multi-Dimensional Torus
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
An efficient non-contiguous processor allocation strategy for 2D mesh connected multicomputers
Information Sciences: an International Journal
Multitoroidal Interconnects For Tightly Coupled Supercomputers
IEEE Transactions on Parallel and Distributed Systems
Availability-based noncontiguous processor allocation policies for 2D mesh-connected multicomputers
Journal of Systems and Software
Routing-contained virtualization based on Up*/Down* forwarding
HiPC'07 Proceedings of the 14th international conference on High performance computing
Fast and efficient processor allocation algorithm for torus-based chip multiprocessors
Computers and Electrical Engineering
| Hi-index | 0.00 |
Efficient allocation of distinct subsets of processors to different jobs (i.e., space sharing) is critical to the performance of parallel computers, especially large scale parallel computers. This paper presents an efficient and lookahead strategy for processor allocation in 3D torus-connected systems, such as the Cray T3D, where each job requests for an exclusive allocation of a 3D submesh. The proposed processor allocation scheme has the following features: complete recognition of all maximal free submeshes, compact representation of submeshes, fairness with FCFS scheduling discipline, higher system utilization with lookahead scheduling, no restriction on the submesh orientation, and low allocation and scheduling overhead. The performance of the proposed strategy is demonstrated through simulation.