A Top-Down Processor Allocation Scheme for Hypercube Computers

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]  Justin R. Rattner.  Concurrent processing: a new direction in scientific computing in afips conference proceedings , 1985 .

[2]  Ming-Syan Chen,et al.  Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

[3]  Bernd Becker,et al.  How robust is the n-cube? , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  D. Grunwald,et al.  The Performance of Multicomputer Interconnection Networks , 1987, Computer.

[5]  M. Bergman,et al.  "Introduction to nMOS and cMOS VLSI Systems Design" by Amar Mukherjee, from: Prentice-Hall, Englewood Cliffs, NJ 07632, U.S.A , 1986, Integr..

[6]  Kenneth C. Knowlton,et al.  A fast storage allocator , 1965, CACM.

[7]  B. Bose,et al.  A new strategy for processors allocation in an N-cube multiprocessor , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[8]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[9]  Dirk Grunwald,et al.  Hyperswitch network for the hypercube computer , 1988, ISCA '88.

[10]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[11]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[12]  J. P. Hayes,et al.  On allocating subcubes in a hypercube multiprocessor , 1988, C3P.

[13]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[14]  John P. Hayes,et al.  Architecture of a Hypercube Supercomputer , 1986, ICPP.