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.

[1]  Lionel M. Ni,et al.  Efficient processor allocation for 3D tori , 1995, Proceedings of 9th International Parallel Processing Symposium.

[2]  Dhiraj K. Pradhan,et al.  A fast and efficient strategy for submesh allocation in mesh-connected parallel computers , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[3]  Craig A. Morgenstern,et al.  Efficient submesh allocation using interval sets , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.

[4]  M. J. Quinn,et al.  Parallel Computing: Theory and Practice , 1994 .

[5]  R. E. Kessler,et al.  Cray T3D: a new dimension for Cray Research , 1993, Digest of Papers. Compcon Spring.

[6]  Tong Liu,et al.  A Submesh Allocation Scheme for Mesh-Connected Multiprocessor Systems , 1995, ICPP.

[7]  Hee Yong Youn,et al.  An efficient task allocation scheme for two-dimensional mesh-connected systems , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[8]  M. J. Quinn,et al.  Parallel computing (2nd ed.): theory and practice , 1994 .

[9]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[10]  Phillip Krueger,et al.  A performance comparison of processor allocation and job scheduling algorithms for mesh-connected multiprocessors , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[11]  Hee Yong Youn,et al.  Dynamic task scheduling and allocation for 3D torus multicomputer systems , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[12]  Laxmi N. Bhuyan,et al.  An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[13]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[14]  Lionel M. Ni,et al.  Routing Techniques in Direct Networks , 1993 .

[15]  Yahui Zhu,et al.  Efficient Processor Allocation Strategie for Mesh-Connected Parallel Computers , 1992, J. Parallel Distributed Comput..