Optimal emulations by butterfly-like networks

DOI10.1145/226643.226658zbMATH Open0882.68006OpenAlexW2008773589MaRDI QIDQ4371672FDOQ4371672

Authors: Sandeep Bhatt, Jia-Wei Hong, B. Obrenić, Arnold L. Rosenberg, Eric J. Schwabe, Fan Chung, F. Thomson Leighton 

Publication date: 21 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1996-43/

Recommendations

• Optimal embeddings of butterfly-like graphs in the hypercube
• An approach to emulating separable graphs
• Embedding circulant networks into butterfly and benes networks
• Work-preserving emulations of fixed-connection networks

zbMATH Keywords

combinatorial algorithmsnonnumerical algorithmsbutterfly-like networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (14)

• Embedding circulant networks into butterfly and benes networks
• Title not available (Why is that?)
• Cycles in butterfly graphs
• On the bisection width and expansion of butterfly networks
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Real-time emulations of bounded-degree networks
• An approach to emulating separable graphs
• Minimum spanners of butterfly graphs
• Regular layouts of butterfly networks
• Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
• Constant-slowdown simulations of normal hypercube algorithms on the butterfly network
• Title not available (Why is that?)
• Compressing cube-connected cycles and butterfly networks
• Improved routing and sorting on multibutterflies

This page was built for publication: Optimal emulations by butterfly-like networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371672)