Broadcasting in butterfly and deBruijn networks (extended abstract)

DOI10.1007/3-540-55210-3_196MaRDI QIDQ5096794zbMATH OpenOpenAlexFDO

Authors Ralf Klasing, Burkhard Monien, Regine Peine, Elena 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

zbMATH Keywords

broadcastingbutterfly networkde Bruijn network

Mathematics Subject Classification ID

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

Recommendations

• Broadcasting in butterfly and deBruijn networks
• scientific article; zbMATH DE number 4102999
• scientific article; zbMATH DE number 219250
• On the optimality of general lower bounds for broadcasting and gossiping
• Broadcasting in DMA-bound bounded degree graphs

Cites work

• A group-theoretic model for symmetric interconnection networks
• A survey of gossiping and broadcasting in communication networks
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• Broadcast Networks of Bounded Degree
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• Broadcasting in Bounded Degree Graphs
• Broadcasting in the butterfly network
• Compressing cube-connected cycles and butterfly networks
• Group Action Graphs and Parallel Architectures
• scientific article; zbMATH DE number 4213420 (Why is no real title available?)
• scientific article; zbMATH DE number 4147467 (Why is no real title available?)
• scientific article; zbMATH DE number 4102999 (Why is no real title available?)
• scientific article; zbMATH DE number 219250 (Why is no real title available?)
• scientific article; zbMATH DE number 219254 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Methods and problems of communication in usual networks
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI

Cited in

(11)

• Broadcasting in the butterfly network
• Broadcasting in butterfly and deBruijn networks
• Note on optimal gossiping in some weak-connected graphs
• Broadcasting and Gossiping in de Bruijn Networks
• scientific article; zbMATH DE number 1953158 (Why is no real title available?)
• scientific article; zbMATH DE number 219250 (Why is no real title available?)
• scientific article; zbMATH DE number 2089975 (Why is no real title available?)
• scientific article; zbMATH DE number 913352 (Why is no real title available?)
• Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
• Gossiping in vertex-disjoint paths mode in interconnection networks
• On the number of broadcast schemes in networks

This page was built for publication: Broadcasting in butterfly and deBruijn networks (extended abstract)

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