Reduction of network cost and wiring in Ranade's butterfly routing

DOI10.1016/0020-0190(93)90217-WMaRDI QIDQ1209323zbMATH OpenFDO

Authors David Cross, Reinhard Drefenstedt, Jörg Keller

Publication date 16 May 1993

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

butterfly networkspacket routing algorithmsRanade's butterfly routing algorithm

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• Regular layouts of butterfly networks
• A tight layout of the butterfly network
• Improved routing and sorting on multibutterflies
• Sharper analysis of packet routing on a butterfly
• Mapping Cycles and Trees on Wrap-Around Butterfly Graphs

Cited in

(2)

• Regular layouts of butterfly networks
• A note on implementing combining networks

This page was built for publication: Reduction of network cost and wiring in Ranade's butterfly routing

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