Optimal emulations by butterfly-like networks

DOI10.1145/226643.226658MaRDI QIDQ4371672zbMATH OpenOpenAlexFDO

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/

zbMATH Keywords

butterfly-like networkscombinatorial algorithmsnonnumerical algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

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

Cited in

(22)

• Real-time emulations of bounded-degree networks
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Binary cube emulation of butterfly networks encoded by Gray code
• On the bisection width and expansion of butterfly networks
• Improved routing and sorting on multibutterflies
• Constant-slowdown simulations of normal hypercube algorithms on the butterfly network
• Minimum spanners of butterfly graphs
• Embedding circulant networks into butterfly and benes networks
• Optimal embeddings of butterfly-like graphs in the hypercube
• scientific article; zbMATH DE number 70115 (Why is no real title available?)
• EFFICIENT EMULATIONS FOR X-TREES AND /w-ARY TREES*
• Efficient self-embedding of butterfly networks with random faults
• An approach to emulating separable graphs
• Regular layouts of butterfly networks
• Index-Shuffle Graphs
• Work-preserving emulations of fixed-connection networks
• scientific article; zbMATH DE number 1760010 (Why is no real title available?)
• Compressing cube-connected cycles and butterfly networks
• Cycles in butterfly graphs
• Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
• New graph decompositions with applications to emulations
• Graph embeddings and simplicial maps

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)