RT Journal Article
JF Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on
YR 1997
VO 00
SP 83
TI An efficient submesh allocation scheme for 3D torus multicomputer systems
A1 Hee Yong Youn,
A1 Seong-Moo Yoo,
A1 Hyunseung Choo,
K1 multiprocessor interconnection networks; submesh allocation scheme; 3D torus multicomputer systems; interconnection topology; message-passing multicomputer systems; first-fit approach; allocation time complexity; deallocation time complexity; free submesh searching; 3D window sliding; Front/Rear data structure; Window Information List
AB 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.
PB IEEE Computer Society, [URL:http://www.computer.org]
LA English
DO 10.1109/AISPAS.1997.581633
LK http://doi.ieeecomputersociety.org/10.1109/AISPAS.1997.581633