This Article 
 Bibliographic References 
 Add to: 
Optimal and Suboptimal Processor Allocation for Hypercycle-based Multiprocessors
February 1995 (vol. 6 no. 2)
pp. 175-185

Abstract—Allocating nodes in a concurrent computer system depends on the topology of the system. In this work, we present a number of processor allocation strategies for Hypercycle based concurrent systems. Hypercycles is a class of multidimensional interconnection networks which includes such widely used networks as the binary $n$-cubes, $k$-ary $n$-cubes, generalized hypercubes etc. The allocation strategies presented include a statically optimal first-fit allocation, a suboptimal-first fit, and strategies with extended search space through the inclusion of additional search lists formed by permuting the base through which a hypercycle is defined. For all these strategies, we examine their optimality and present simulation results characterizing their performance relative to each other.

[1] A. Al-Bassam, H. El-Rewini, B. Bose, and T. Lewis,“Efficient serial and parallel subcube recognition in hypercubes,”inProc. Fifth Distrib. Memory Comp. Conf., Apr. 1990, pp. 64–71.
[2] A. Al-Dhelaan and B. Bose,“A new strategy for processors allocation in an$N$-cube multiprocessor,”inProc. Int. Phoenix Conf. Comput. Commun., Mar. 1989, pp.114–118.
[3] L. N. Bhuyan and D. P. Agrawal,“Design and performance of generalized interconnection networks,”IEEE Trans. Comput., vol. C–32, pp. 1081–1090, Dec. 1983.
[4] L. N. Bhuyan and D. P. Agrawal,“Generalized hypercube and hyperbus structures for a computer network,”IEEE Trans. Comput., vol. C-33, pp. 323–333, Apr. 1984.
[5] F. Boesch and R. Tindell,“Circulants and their connectivities,”J. Graph Theory, vol. 8, pp. 487–499, 1984.
[6] M. S. Chen and K. G. Shin,“Processor allocation in an$N$-cube multiprocessor using gray codes,”IEEE Trans. Comput., vol. C-37, pp. 1396–1407, Dec. 1987.
[7] E. Chow, H. Madan, J. Peterson, D. Grunwald, and D. Reed,“Hyperswitch network for the hypercube computer,”inProc. 15th Annu. Int. Symp. Comput. Architect., May 1988, pp. 90–99.
[8] P.-J. Chuang and N.-J. Tzeng,“Dynamic processor allocation in hypercube computers,”inProc. 17th Annu. Int. Symp. Comput. Architect., May 1990, pp. 40–49.
[9] W. Dally,“Performance analysis of$k$-ary$n$-cube interconnection networks,”IEEE Trans. Comput., vol. 39, pp. 775–784, June 1990.
[10] V. V. Dimakopoulos,“Processor allocation and message broadcasting in hypercycle interconnection networks,”M.A.Sc. thesis, Dep. Elec. Comput. Eng., Univ. of Victoria, 1992.
[11] N. J. Dimopoulos, R. D. Rasmussen, G. S. Bolotin, B. F. Lewis, and R. M. Manning,“Hypercycles, interconnection networks with simple routing strategies,”inProc. Canadian Conf. Elec. Comput. Eng., Nov. 1988, pp. 577–80.
[12] N. Dimopoulos, D. Radvan, and K. F. Li,“Performance evaluation of the backtrack to the origin and retry routing for hypercycle-based interconnection networks,”inProc. Tenth Int. Conf. Distrib. Comput. Syst., ACM, June 1990, pp. 278–284.
[13] N. J. Dimopoulos, R. Shivakumar, and D. Radvan,“Routing and processor allocation on a hypercycle-based multiprocessor,”inProc. 1991 Int. Conf. Supercomput., ACM, June 1991, pp. 106-114.
[14] N. J. Dimopoulos, M. Chowdhury, R. Sivakumar, and V. Dimakopoulos,“Routing in hypercycles—Deadlock free and backtracking strategies,”inProc., PARLE '92 Parallel Architect. and Languages Europe '92, June 1992, pp. 973–997.
[15] S. Dutt and J. P. Hayes,“Subcube allocation in hypercube computers,”IEEE Trans. Comput., vol. 40, pp. 341–352, Mar. 1991.
[16] J. Kim, C. R. Das, and W. Lin,“A top-down processor allocation scheme for hypercube computers,”IEEE Trans. Parallel and Distrib. Syst., vol. 2, pp. 20–30, Jan 1991.
[17] J. C. Peterson, J. O. Tuazon, D. Lieberman, and M. Pniel,“The MARK III hypercube-ensemble concurrent computer,”inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 71–73.
[18] R. D. Rasmussen, G. S. Bolotin, N. J. Dimopoulos, B. F. Lewis, and R. M. Manning,“Advanced general purpose multicomputer for space applications,”inProc. 1987 Int. Conf. Parallel Processing, Aug. 1987, pp. 54–57.
[19] R. D. Rasmussen, N. J. Dimopoulos, G. S. Bolotin, B. F. Lewis, and R. M. Manning,“MAX: Advanced general purpose real-time multicomputer for space applications,”inProc. IEEE Real Time Syst. Symp., Dec. 1987, pp. 70–78.
[20] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[21] R. Sivakumar, N. J. Dimopoulos, V. Dimakopoulos, M. Chowdhury,“Implementation of the routing engine for hypercycle based interconnection networks,”inProc. Canadian Conf. VLSI, Aug. 1991, pp. 6.4.1–6.4.7.
[22] A. S. Tanenbaum,Operating Systems: Design and Implementation. Englewood Cliffs, NJ: Prentice-Hall, 1987.

Nikitas J. Dimopoulos, Vassilios V. Dimakopoulos, "Optimal and Suboptimal Processor Allocation for Hypercycle-based Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 2, pp. 175-185, Feb. 1995, doi:10.1109/71.342130
Usage of this product signifies your acceptance of the Terms of Use.