A novel approach for subcube allocation in hypercube multiprocessors

A novel approach for dynamic subcube allocation in hypercube multiprocessors which supports a multiuser environment is proposed. A dynamic binary tree with nodes labeled by a binary reflected gray code is used for processor allocation along with two arrays of free lists. The time complexities for both allocation and deallocation are shown to be linear-orders of magnitude improvement over the existing exponential and even superexponential algorithms. A best-fit strategy, the proposed scheme does not excessively fragment the hypercube, unlike some existing strategies. In addition, static optimality is guaranteed. The performance of the proposed scheme is compared on such parameters as average delay in honouring a request, average allocation time, and average deallocation time against some existing schemes, demonstrating its effectiveness.<<ETX>>

[1]  Ming-Syan Chen,et al.  Subcube Allocation and Task Migration in Hypercube Multiprocessors , 1990, IEEE Trans. Computers.

[2]  Ophir Frieder,et al.  Multiprocessor algorithms for relational-database operators on hypercube systems , 1990, Computer.

[3]  J. Kim,et al.  A Top-Down Processor Allocation Scheme for Hypercube Computers , 1991, IEEE Trans. Parallel Distributed Syst..

[4]  John C. Peterson,et al.  The Mark III Hypercube-Ensemble Concurrent Computer , 1985, International Conference on Parallel Processing.

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

[6]  John P. Hayes,et al.  A Microprocessor-based Hypercube Supercomputer , 1986, IEEE Micro.

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

[8]  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.

[9]  Nian-Feng Tzeng,et al.  Dynamic processor allocation in hypercube computers , 1990, ISCA '90.

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

[11]  Qing Yang,et al.  Prime Cube Graph Approach for Processor Allocation in Hypercube Multiprocessors , 1991, ICPP.

[12]  John L. Gustafson,et al.  The Architecture of a Homogeneous Vector Supercomputer , 1986, J. Parallel Distributed Comput..

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

[14]  Seung Ryoul Maeng,et al.  A heuristic processor allocation strategy in hypercube systems , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[15]  Chita R. Das,et al.  A Processor Allocation Scheme for Hypercube Computers , 1989, ICPP.

[16]  Justin R. Rattner.  Concurrent processing: a new direction in scientific computing in afips conference proceedings , 1985 .