Communication throughput of interconnection networks

DOI10.1007/3-540-58338-6_60zbMath1493.68029OpenAlexW1550484165MaRDI QIDQ5096871

Burkhard Monien, Reinhard Lüling, Ralf Diekmann

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_60

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Bisecting de Bruijn and Kautz graphs

Cites Work

• Applied simulated annealing
• On forwarding indices of networks
• Efficient Schemes for Parallel Communication
• A Separator Theorem for Planar Graphs
• A Scheme for Fast Parallel Communication
• On the Problem of Partitioning Planar Graphs
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• The bisection width of cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Communication throughput of interconnection networks