Mapping cycles and trees on wrap-around butterfly graphs

SIAM Journal on Computing

Volumn 35, Issue 3, 2005, Pages 741-765

  Wagh, Meghanad D ^a   Guzide, Osman ^b  

^a Lehigh University   (United States)

^b SHEPHERD UNIVERSITY   (United States)

Author keywords

Butterfly graphs; Cycles; Finite field; Mapping; Mathematical model; Trees

Indexed keywords

BUTTERFLY GRAPHS; FINITE FIELD; NETWORK CONNECTIVITY;

ALGEBRA; CONFORMAL MAPPING; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS;

TREES (MATHEMATICS);

EID: 33745447235     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799365462     Document Type: Article

References (13)

1. E. R. BERLEKAMP, Algebraic Coding Theory, McGraw-Hill, New York, 1968.
2. S. N. BHATT, F. R. K. CHUNG, J. HONG, F. T. LEIGHTON, B. OBRENIC, A. L. ROSENBERG, AND E. J. SCHWABE, Optimal emulation by butterfly-like networks, J. ACM, 43 (1996), pp. 293-330.
3. G. CHEN AND C. M. LAU, Comments on "A new family of Cayley graph interconnection networks of constant degree four", IEEE Trans. Parallel Distrib. Syst., 8 (1997), pp. 1299-1300.
4. R. FELDMANN AND W. UNGER, The cube-connected cycle is a subgraph of the butterfly network, Parallel Process. Lett., 2 (1992), pp. 13-19.
5. C. T. GRAY, W. LIU, T. HUGHES, AND R. CAVIN, The design of a high-performance scalable architecture for image processing applications, in Proceedings of the 1990 International Conference on Application Specific Array Processors, IEEE, Piscataway, NJ, 1991, pp. 722-733.
6. A. GUPTA AND S. E. HAMBRUSCH, Embedding complete binary trees into butterfly networks, IEEE Trans. Comput., 40 (1991), pp. 853-863.
7. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufman, San Mateo, CA, 1992.
8. W. LIN, T. SHEU, C. R. DAS, T. FENG, AND C. WU, Fast data selection and broadcast on the butterfly network, in Proceedings of the International Workshop on Future Trends of Distributed Computing Systems in the 1990s, 1998, pp. 65-72.
9. A. RANADE, Optimal speedup for backtrack search on a butterfly network, Math. Systems Theory, 27 (1994), pp. 85-102.
10. J. H. REIF AND S. SEN, Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications, SIAM J. Comput., 23 (1994), pp. 633-651.
11. A. L. ROSENBERG, Cycles in Networks, Technical report 91-20, University of Massachusetts, Amherst, 1993.
12. E. J. SCHWABE, Constant-slowdown simulations of normal hypercube algorithms on the butterfly network, Inform. Process. Lett., 45 (1993), pp. 295-301.
13. P. VADAPALLI AND K. SRIMANI, A new family of Cayley graph interconnection networks of constant degree four, IEEE Trans. Parallel Distrib. Syst., 17 (1996), pp. 26-32.