This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Processor Scheduling and Allocation for 3D Torus Multicomputer Systems
May 2000 (vol. 11 no. 5)
pp. 475-484

Abstract—Multicomputer systems achieve high performance by utilizing a number of computing nodes. Recently, by achieving significant reductions in communication delay, the three-dimensional (3D) torus has emerged as a new candidate interconnection topology for message-passing multicomputer systems. In this paper, we propose an efficient processor allocation scheme—scan search scheme—for the 3D torus based on a first-fit approach. The scan search scheme minimizes the average allocation time for an incoming task by effectively manipulating the 3D information on a torus as 2D information using a data structure called the CST (Coverage Status Table). Comprehensive computer simulation reveals that the allocation time of the scan search scheme is always smaller than that of the earlier scheme based on a best-fit approach. The difference gets larger as the input load increases, and it is as much a factor of 3 for high load. To investigate the performance of the proposed scheme in different scheduling environments, we also consider a non-FCFS scheduling policy along with the typical FCFS policy. The allocation time complexity of the scan search scheme is $O(LW^{2}H^{2})$. This is significantly smaller than that of the existing scheme which is $O(L^{4}W^{4}H^{4})$. Here, $L$, $W$, and $H$ represent the length, width, and height of 3D torus, respectively.

[1] M.J. Quinn, Parallel Computing: Theory and Practice.New York: McGraw-Hill, 1994.
[2] K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, 1993.
[3] NCUBE Corp., NCUBE/ten: An Overview. Beaverton, Ore., Nov. 1985.
[4] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[5] “Paragon XP/S Product Overview,” Intel Corporation, 1991.
[6] “A Touchstone DELTA System Description,” Intel Corporation 1991.
[7] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[8] R.E. Kessler and J.L. Schwarzmeier, "CRAY T3D: A New Dimension for Cray Research," Proc. COMPCON, pp. 176-182, Feb. 1993.
[9] Y. Zhu, “Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers,” J. Parallel and Distributed Computing, vol. 16 pp. 328–337, Dec. 1992.
[10] J. Ding and L.N. Bhuyan, “An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems,” Int'l Conf. Parallel Processing, pp. II–193–200, Aug. 1993.
[11] D.D. Sharma and D.K. Pradhan, “Job Scheduling in Mesh Multicomputers,” IEEE Trans. Parallel and Distributed Systems, pp. 57–70, Jan. 1998.
[12] M.E. Houle and G.T. Toussaint, "Computing the Width of a Set," Proc. First ACM Symp. Computational Geometry, pp. 1-7, 1985.
[13] D. Babbar and P. Krueger, “A Performance Comparison of Processor Allocation and Job Scheduling Algorithms for Mesh-Connected Multiprocessors,” Proc. Sixth IEEE Symp. Parallel and Distributed Processing, pp. 46-53, Oct. 1994.
[14] S.M. Yoo and H.Y. Youn, “An Efficient Task Allocation Scheme for 2D Mesh Architectures,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 9, pp. 934-942, Sept. 1997.
[15] T. Lin, W-K. Huang, F. Lombardi, and L.N. Bhuyan, “A Submesh Allocation Scheme for Mesh-Connected Multiprocessor Systems,” Int'l Conf. Parallel Processing, pp. II–159–163, Aug. 1995.
[16] W. Qiao and L.M. Ni, “Efficient Processor Allocation for 3D Tori,” Proc. Int'l Parallel Processing Symp., pp. 466-471, 1995.

Index Terms:
Best-fit and first-fit approach, multicomputer, processor scheduling and allocation, 3D torus.
Citation:
Hyunseung Choo, Seong-Moo Yoo, Hee Yong Youn, "Processor Scheduling and Allocation for 3D Torus Multicomputer Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 5, pp. 475-484, May 2000, doi:10.1109/71.852400
Usage of this product signifies your acceptance of the Terms of Use.