Broadcasting in butterfly and deBruijn networks

DOI10.1016/0166-218X(94)90184-8zbMath0807.94035OpenAlexW1969468870MaRDI QIDQ1339890

Regine Peine, Ralf Klasing, Elena A. Stöhr, Burkhard Monien

Publication date: 8 March 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90184-8

zbMATH Keywords

butterfly networkbroadcastingde Bruijn network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Methods and problems of communication in usual networks ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint modes ⋮ Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ Gossiping and broadcasting versus computing functions in networks. ⋮ Lower bounds on systolic gossip ⋮ The forwarding indices of wrapped butterfly networks ⋮ TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION

Cites Work

• Broadcasting in the butterfly network
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• Methods and problems of communication in usual networks
• Group Action Graphs and Parallel Architectures
• A survey of gossiping and broadcasting in communication networks
• Broadcast Networks of Bounded Degree
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• A group-theoretic model for symmetric interconnection networks
• Broadcasting in Bounded Degree Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Broadcasting in butterfly and deBruijn networks