Job simulation techniques on incomplete and Gray code incomplete hypercubes

We show that any job (in particular, data communication techniques such as sorting, merging, parallel prefix, distribution etc.) can be executed on the synchronous model of incomplete hypercube within asymptotically the same time complexity as on a (complete) hypercube of appropriate size. We then obtain similar results for the GCIH (Gray code incomplete hypercube) model. GCIHs have some applications based on partitioning a (complete) hypercube into several GCIHs, each being temporarily isolated from the rest of hypercube. GCIHs provide a very simple method to allocate some processors to perform a job on a complete hypercube, since it enables the memory allocation techniques for sequential computers to be directly used. The other application is in image processing and other fields where multiple component problems occur.<<ETX>>

[1]  Howard P. Katseff,et al.  Incomplete Hypercubes , 1988, IEEE Trans. Computers.

[2]  Nian-Feng Tzeng,et al.  Enhanced Incomplete Hypercubes , 1989, ICPP.

[3]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[4]  Gen-Huey Chen,et al.  Bitonic Sort with an Arbitrary Number of Keys , 1991, ICPP.

[5]  Wei-Pang Yang,et al.  Broadcasting on incomplete hypercubes , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[6]  Sartaj Sahni,et al.  Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[7]  Naveed A. Sherwani,et al.  Fully normal algorithms for incomplete hypercubes , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[8]  Shyan-Ming Yuan.  Topological Properties of Supercube , 1991, Inf. Process. Lett..

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

[10]  Pavel Tvrdík.  On Incomplete Hypercubes , 1992, CONPAR.

[11]  S. Lennart Johnsson,et al.  Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures , 1987, J. Parallel Distributed Comput..

[12]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[13]  Nian-Feng Tzeng,et al.  An Effective Approach t the Enhancement of Incomplete Hypercube Computers , 1992, J. Parallel Distributed Comput..

[14]  Ivan Stojmenovic.  Routing and Broadcasting on Incomplete and Gray Code Incomplete Hypercubes , 1993, Parallel Algorithms Appl..

[15]  Jorge L. C. Sanz,et al.  Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling , 1987, J. Algorithms.

[16]  Nian-Feng Tzeng,et al.  Embeddings in Incomplete Hypercubes , 1990, ICPP.

[17]  Ajay Gupta,et al.  On optimal embeddings into incomplete hypercubes , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[18]  Nian-Feng Tzeng.  Structural properties of incomplete hypercube computers , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.