Broadcasting in butterfly and debruijn networks
From MaRDI portal
Publication:5096794
DOI10.1007/3-540-55210-3_196zbMath1494.68020MaRDI QIDQ5096794
Ralf Klasing, Regine Peine, Burkhard Monien, Elena A. Stöhr
Publication date: 18 August 2022
Published in: STACS 92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55210-3_196
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes, Gossiping in vertex-disjoint paths mode in interconnection networks, Note on optimal gossiping in some weak-connected graphs
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
- Compressing cube-connected cycles and butterfly networks
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item