Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1997)
Aizu-Wakamatsu, Fukushima, JAPAN
Mar. 17, 1997 to Mar. 21, 1997
Hyunseung Choo , Dept. of Comput. Sci. & Eng., Texas Univ., Arlington, TX, USA
Hee Yong Youn , Dept. of Comput. Sci. & Eng., Texas Univ., Arlington, TX, USA
Seong-Moo Yoo , Dept. of Comput. Sci. & Eng., Texas Univ., Arlington, TX, USA
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.
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
H. Y. Youn, S. Yoo and H. Choo, "An efficient submesh allocation scheme for 3D torus multicomputer systems," Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on(PAS), Aizu-Wakamatsu, Fukushima, JAPAN, 1997, pp. 83.