Optimal emulations by butterfly-like networks

Journal of the ACM

Volumn 43, Issue 2, 1996, Pages 293-330

  Bhatt, Sandeep N ^a   Chung, Fan R K ^a   Hong, Jia Wei ^b,g   Leighton, F Thomson ^c,h   Obrenić, Bojana ^d   Rosenberg, Arnold L ^e,i   Schwabe, Eric J ^f,j  

^a TELCORDIA TECHNOLOGIES   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d CITY UNIVERSITY OF NEW YORK   (United States)

^e UNIVERSITY OF MASSACHUSETTS   (United States)

^f NORTHWESTERN UNIVERSITY   (United States)

^g NEW YORK UNIVERSITY   (United States)

^h MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

ⁱ Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^j Northwestern University   (United States)

more..

Author keywords

Algorithms; Design; Embeddings; Emulations; Mapping algorithms; Mapping problems; Parallel architectures; Processor arrays; Theory

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER ARCHITECTURE; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS;

BINARY TREES; BUTTERFLY LIKE NETWORKS; DE BRUIJI NETWORKS; EMBEDDINGS; HYPERCUBES; MAPPING ALGORITHMS; MAPPING PROBLEMS; OPTIMAL EMULATIONS; PARALLEL ARCHITECTURE; PROCESSOR ARRAYS;

INTERCONNECTION NETWORKS;

EID: 0030103079     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/226643.226658     Document Type: Article

References (28)

1. AGGARWAL, A. 1984. A comparative study of X-tree, pyramid, and related machines. In Proceedings of the 25th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 89-99.
2. ANNEXSTEIN, F. S. 1989. Fault tolerance in hypercube-derivative networks. In Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures (Santa Fe, N.M., June 18-21). ACM, New York, pp. 179-188.
3. ANNEXSTEIN, F. S., BAUMSLAG, M., AND ROSENBERG, A. L. 1990. Group action graphs and parallel architectures. SIAM J. Comput. 19, 544-569.
4. BENEŠ, V. E. 1964. Optimal rearrangeable multistage connecting networks. Bell Syst. Tech. J. 43, 1641-1656.
5. BHATT, S. N., CHUNG, F. R. K., LEIGHTON, F. T., AND ROSENBERG, A. L. 1992. Efficient embeddings of trees in hypercubes. SIAM J. Comput. 21, 1, 151-162.
6. BHATT, S. N., AND IPSEN, I. 1985. How to embed trees in hypercubes. Yale Univ. Res. Rep. DCS/RR-443. Yale Univ., New Haven, Conn.
7. BHATT, S. N., AND LEIGHTON, F. T. 1984. A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, 300-343.
8. CHAN, M. Y. 1988. Dilation-2 embedding of grids into hypercubes. In Proceedings of the 1988 International Conference on Parallel Processing (University Park, Pa.). IEEE, New York, pp. 295-298.
9. CHAN, M. Y. 1991. Embedding of grids into optimal hypercubes. SIAM J. Comput. 20, 834-864.
10. DESPAIN, A. M., AND PATTERSON, D. A. 1978. X-tree - A tree structured multiprocessor architecture. In Proceedings of the 5th Symposium on Computer Architecture (Palo Alto, Calif.). IEEE, New York, pp. 144-151.
11. GANNON, D. 1980. A note on pipelining a mesh-connected multiprocessor for finite element problems by nested dissection. In Proceedings of the 1980 International Conference on Parallel Processing (St. Charles, Ill.). IEEE, New York, pp. 197-204.
12. GINOSAR, R., AND EGOZI, D. 1987. Topological comparison of perfect shuffle and hypercube. Typescript, The Technion, Rehovot, Israel.
13. GEENBERG, D. S., HEATH, L. S., AND ROSENBERG, A. L. 1990. Optimal embeddings of butterflylike graphs in the hypercube. Math. Syst. Th. 23, 61-77.
14. HAVEL, I., AND LIEBL, P. 1973. Embedding the polytomic tree into the n-cube. Časopis pro Pěstováni Matematiky 98, 307-314.
15. HONG, J.-W., AND ROSENBERG, A. L. 1982. Graphs that are almost binary trees. SIAM J. Comput. 11, 227-242.
16. HOROWITZ, E., AND ZORAT, A. 1981. The binary tree as an interconnection network: applications to multiprocessor systems and VLSI. IEEE Trans. Comp. C-30, 247-253.
17. KOCH, R., LEIGHTON, F. T., MAGGS, B., RAO, S., ROSENBERG, A. L., AND SCHWABE, E. J. 1996. Work-preserving emulations of fixed-connection networks. J. ACM, to appear.
18. KRUSKAL, C. P., AND SNIR, M. 1986. A unified theory of interconnection network structure. Theor. Comput. Sci. 48, 75-94.
19. LEIGHTON, F. T. 1984. Parallel computation using meshes of trees. In Proceedings of the 1983 Workshop on Graph-Theoretic Concepts in Computer Science. Trauner Verlag, Linz, Austria, pp. 200-218.
20. LEIGHTON, F. T. 1992. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan-Kaufmann, San Mateo, Calif.
21. LEIGHTON, F. T., MAGGS, B., AND RAO, S. 1994. Packet routing and job-shop scheduling in O (congestion + dilation) steps. Combinatorica 14, 2, pp. 167-180.
22. OBRENIĆ, B. 1994. An approach to emulating separable graphs. Math. Syst. Theory 27, 41-63.
23. PREPARATA, F. P., AND VUILLEMIN, J. E. 1981. The cube-connected cycles: A versatile network for parallel computation. Commun. ACM 24, 300-309.
24. ROSENBERG, A. L. 1981. Issues in the study of graph embeddings. In Graph-Theoretic Concepts in Computer Science: Proceedings of the International Workshop WG80, Bad Honnef, Germany, H. Noltemeier, ed. Lecture Notes in Computer Science, vol. 100. Springer-Verlag, New York, pp. 150-176.
25. ROSENBERG, A. L. 1992. Product-shuffle networks: Toward reconciling shuffles and butterflies. Discr. Appl. Math. 37/38, 456-488.
26. SAAD, Y., AND SCHULTZ, M. H. 1988. Topological properties of hypercubes. IEEE Trans. Comput. 37, 867-872.
27. SIEGEL, H. J. 1985. Interconnection Networks for Large-Scale Parallel Processing. D.H. Heath and Co., Lexington, Mass.
28. VIZING, V. G. 1964. On an estimate of the chromatic class of a p-graph (in Russian). Diskret. Analiz 3, 25-30.