Journal of Parallel and Distributed Computing
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Performance improvement of allocation schemes for mesh-connected computers
Journal of Parallel and Distributed Computing
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead
IEEE Transactions on Parallel and Distributed Systems
A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers
IEEE Transactions on Computers
Allocating Precise Submeshes in Mesh Connected Systems
IEEE Transactions on Parallel and Distributed Systems
Efficient processor allocation for 3D tori
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
ProcSimity: an experimental tool for processor allocation and scheduling in highly parallel systems
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Towards scalable collective communication for multicomputer interconnection networks
Information Sciences: an International Journal - Special issue: Information technology
A hybrid search algorithm with heuristics for resource allocation problem
Information Sciences—Informatics and Computer Science: An International Journal
Fragmentation-Efficient Node Allocation Algorithm in 2D Mesh-Connected Systems
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
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
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 2
An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers
Journal of Systems and Software
Open job management architecture for the blue gene/l supercomputer
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
A temperature-aware virtual submesh allocation scheme for noc-based manycore chips
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A new performance measure for characterizing fault rings in interconnection networks
Information Sciences: an International Journal
Performance evaluation of noncontiguous allocation algorithms for 2D mesh interconnection networks
Journal of Systems and Software
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
Hi-index | 0.07 |
In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is increased. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Greedy-Available-Busy-List, is suggested for the 2D mesh network. Request partitioning in our suggested strategy is based on the sub-meshes available for allocation. To evaluate the performance improvement achieved by our strategy and compare it against well-known existing non-contiguous and contiguous strategies, we conduct extensive simulation runs under the assumption of wormhole routing and three communication patterns, notably one-to-all, all-to-all and random. The results show that the new strategy can reduce the communication overhead and substantially improve performance in terms of job turnaround time and system utilization.