This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Top-Down Processor Allocation Scheme for Hypercube Computers
January 1991 (vol. 2 no. 1)
pp. 20-30

An efficient processor allocation policy is presented for hypercube computers. The allocation policy is called free list since it maintains a list of free subcubes available in the system. An incoming request of dimension k (2/sup k/ nodes) is allocated by finding a free subcube of dimension k or by decomposing an available subcube of dimension greater than k. This free list policy uses a top-down allocation rule in contrast to the bottom-up approach used by the previous bit-map allocation algorithms. This allocation scheme is compared to the buddy, gray code (GC), and modified buddy allocation policies reported for the hypercubes. It is shown that the free list policy is optimal in a static environment, as are the other policies, and it also gives better subcube recognition ability compared to the previous schemes in a dynamic environment. The performance of this policy, in terms of parameters such as average delay, system utilization, and time complexity, is compared to the other schemes to demonstrate its effectiveness. The extension of the algorithm for parallel implementation, noncubic allocation, and inclusion/exclusion allocation is also given.

[1] E. Chow, H. S. Madan, J. C. Peterson, D. Grunwald, and D. Reed, "Hyperswitch network for the hypercube computer," inProc. 15th Ann. Int. Symp. Comput. Architecture, 1988, pp. 90-99.
[2] D. A. Reed and D. C. Grunwald, "The performance of multicomputer interconnection networks,"IEEE Comput. Mag., vol. 20, pp. 63-73, June 1987.
[3] L.N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., pp. 323-333, Apr. 1984.
[4] L. D. Wittie, "Communication structures for a large multicomputer system,"IEEE Trans. Comput., vol. C-30, pp. 264-273, Apr. 1981.
[5] M. S. Chen and K. G. Shin, "Embedding of interacting task modules into a hypercube," inProc. 2nd Hypercube Conf., Oct. 1986, pp. 122-129.
[6] B. Becker and H.U. Simon, "How robust is the n-cube?," inProc. 27th Annu. Symp. Foundations Comput. Sci., Oct. 1986, pp. 283-291
[7] J. Rattner, "Concurrent processing: A new direction in scientific computing," inAFIPS Conf. Proc., vol. 54, NCC, 1985, pp. 157-166.
[8] J. P. Hayes, T.N. Mudge,et al., "Architecture of a hypercube supercomputer," inProc. Int. Conf. Parallel Processing, Aug. 1986, pp. 653-660.
[9] J. C. Petersonet al., "The Mark III hypercube ensemble concurrent processor," inProc. Int. Conf. Parallel Processing, Aug. 1985, pp. 71-73.
[10] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[11] Y. Saad and M. H. Schultz, "Topological properties of hypercube,"IEEE Trans. Comput., vol. 37, pp. 867-872, July 1988.
[12] K. C. Knowlton, "A fast storage allocator,"Commun. ACM, vol. 8, no. 10, pp. 623-625, Oct. 1965.
[13] NCUBE Corp., "NCUBE/ten: An overview," Beaverton, OR, Nov. 1985.
[14] M.-S. Chen and K. G. Shin, "Processor allocation in anN-cube multiprocessorusing Gray codes,"IEEE Trans. Comput., vol. C-36, no. 12, pp. 1396-1407, Dec. 1987.
[15] A. Al-Dhelaan and B. Bose, "A new strategy for processor allocation in an N-cube multiprocessor," inProc. Phoenix Conf. Comput. and Commun., Mar. 1989, pp. 114-118.
[16] S. Dutt and J. P. Hayes, "On allocating subcubes in a hypercube multiprocessor," inProc. Third Conf. Hypercube Comput. Appl., Pasadena, CA, Jan. 1988, pp. 801-810.
[17] E. J. McClusky,Logic Design Principles.Englewood Cliffs, NJ: Prentice-Hall, 1986.

Index Terms:
top-down processor allocation scheme; hypercube computers; free list; bottom-upapproach; gray code; buddy allocation; average delay; system utilization; timecomplexity; parallel implementation; noncubic allocation; inclusion/exclusion allocation;hypercube networks; parallel processing
Citation:
J. Kim, C.R. Das, W. Lin, "A Top-Down Processor Allocation Scheme for Hypercube Computers," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 1, pp. 20-30, Jan. 1991, doi:10.1109/71.80186
Usage of this product signifies your acceptance of the Terms of Use.