Communications of the ACM - Special section on computer architecture
Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
An Efficient Task Allocation Scheme for 2D Mesh Architectures
IEEE Transactions on Parallel and Distributed Systems
Job Scheduling in Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Efficient processor allocation for 3D tori
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Job Scheduling for the BlueGene/L System
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Dynamic Processor Allocation in Large Mesh-Connected Multicomputers
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Information Processing Letters
Characterizing r-perfect codes in direct products of two and three cycles
Information Processing Letters
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
Distributed dynamic processor allocation for multicomputers
Parallel Computing
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
Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers
Journal of Systems and Software
Resource allocation and utilization in the Blue Gene/L supercomputer
IBM Journal of Research and Development
Characterizing r-perfect codes in direct products of two and three cycles
Information Processing Letters
Processor allocation and job scheduling on 3D mesh interconnection networks
International Journal of Computers and Applications
Routing-contained virtualization based on Up*/Down* forwarding
HiPC'07 Proceedings of the 14th international conference on High performance computing
An adaptive job scheduling scheme for mesh-connected multicomputers
The Journal of Supercomputing
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers
The Journal of Supercomputing
Using task migration to improve non-contiguous processor allocation in NoC-based CMPs
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
Multicomputer systems achieve high performance by utilizing a number of computing nodes. Recently, by achieving significant reductions in communication delay, the three-dimensional (3D) torus has emerged as a new candidate interconnection topology for message-passing multicomputer systems. In this paper, we propose an efficient processor allocation scheme驴scan search scheme驴for the 3D torus based on a first-fit approach. The scan search scheme minimizes the average allocation time for an incoming task by effectively manipulating the 3D information on a torus as 2D information using a data structure called the CST (Coverage Status Table). Comprehensive computer simulation reveals that the allocation time of the scan search scheme is always smaller than that of the earlier scheme based on a best-fit approach. The difference gets larger as the input load increases, and it is as much a factor of 3 for high load. To investigate the performance of the proposed scheme in different scheduling environments, we also consider a non-FCFS scheduling policy along with the typical FCFS policy. The allocation time complexity of the scan search scheme is $O(LW^{2}H^{2})$. This is significantly smaller than that of the existing scheme which is $O(L^{4}W^{4}H^{4})$. Here, $L$, $W$, and $H$ represent the length, width, and height of 3D torus, respectively.