An efficient submesh allocation scheme for 3D torus multicomputer systems

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.