Communication throughput of interconnection networks

DOI10.1007/3-540-58338-6_60zbMATH Open1493.68029OpenAlexW1550484165MaRDI QIDQ5096871FDOQ5096871

Authors: 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

Recommendations

• Cost-performance tradeoffs for interconnection networks
• Capacity of interconnected ring communication systems with unique loop-free routing (Corresp.)
• scientific article; zbMATH DE number 2090659
• Modeling of interconnection subsystems for massively parallel computers
• Generating systems of equations for performance evaluation of multistage interconnection networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• A Separator Theorem for Planar Graphs
• Applied simulated annealing
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• On the Problem of Partitioning Planar Graphs
• The bisection width of cubic graphs
• A Scheme for Fast Parallel Communication
• On forwarding indices of networks
• Title not available (Why is that?)
• Efficient Schemes for Parallel Communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Bisecting de Bruijn and Kautz graphs
• Title not available (Why is that?)

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

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