Communications of the ACM - Special section on computer architecture
Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
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
An efficient task allocation scheme for two-dimensional mesh-connected systems
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
(R) Dynamic Task Scheduling and Allocation for 3D Torus Multicomputer Systems
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 3
An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 02
Efficient Processor Allocation Scheme for Multi Dimensional Interconnection Networks
ICPP '97 Proceedings of the international Conference on Parallel Processing
| Hi-index | 0.00 |
Recently, the 3D torus has emerged as a new candidate interconnection topology for message-passing multicomputer systems. In this paper, we propose an efficient submesh allocation scheme for 3D tori based on a first-fit approach. The scheme minimizes the allocation and deallocation time complexity by employing an efficient mechanism for searching a free submesh based on 3D window sliding, and manipulating new data structures called Front/Rear and the Window Information List (WIL). The allocation and deallocation time complexities of the proposed scheme are O(LWH/sup 2/) and O(LH), respectively (where L, W and H represent the length, width and height of the 3D torus), which are significantly smaller than earlier schemes.