Embedding of tree networks into hypercubes

Abstract The hypercube is a good host graph for the embedding of networks of processors because of its low degree and low diameter. Graphs such as trees and arrays can be embedded into a hypercube with small dilation and expansion costs, but there are classes of graphs which can be embedded into a hypercube only with large expansion cost or large dilation cost.

[1]  Arnold L. Rosenberg,et al.  Issues in the Study of Graph Embeddings , 1980, WG.

[2]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[3]  Anthony P. Reeves,et al.  A Systematically Designed Binary Array Processor , 1980, IEEE Transactions on Computers.

[4]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

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

[6]  Arnold L. Rosenberg,et al.  Cost Trade-offs in Graph Embeddings, with Applications , 1983, JACM.

[7]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8]  Richard J. Lipton,et al.  Space and Time Hierarchies for Classes of Control Structures and Data Structures , 1976, JACM.

[9]  Azriel Rosenfeld,et al.  Cellular Graph Automata. I. Basic Concepts, Graph Property Measurement, Closure Properties , 1979, Inf. Control..

[10]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[11]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[12]  Allen R. Hanson,et al.  Processing Cones: A Computational Structure for Image Analysis. , 1981 .

[13]  Jia-Wei Hong,et al.  Graphs that are Almost Binary Trees , 1982, SIAM J. Comput..

[14]  Arnold L. Rosenberg,et al.  Encoding Data Structures in Trees , 1979, JACM.

[15]  David J. Kuck,et al.  A Survey of Parallel Machine Organization and Programming , 1977, CSUR.

[16]  Arnold L. Rosenberg,et al.  Three-Dimensional VLSI: a case study , 1983, JACM.

[17]  Leonard Uhr,et al.  Layered "Recognition Cone" Networks That Preprocess, Classify, and Describe , 1972, IEEE Transactions on Computers.

[18]  David S. Wise.  Compact Layouts of Banyan/FFT Networks , 1981 .

[19]  Azriel Rosenfeld,et al.  Cellular Graph Automata. II. Graph and Subgraph Isomorphism, Graph Structure Recognition , 1979, Inf. Control..

[20]  Richard J. Lipton,et al.  On Small Universal Data Structures and Related Combinatorial Problems. , 1978 .

[21]  Ahmed Sameh,et al.  The Illiac IV system , 1972 .