Communication throughput of interconnection networks
From MaRDI portal
Publication:5096871
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
Cites work
- scientific article; zbMATH DE number 1003300 (Why is no real title available?)
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 176141 (Why is no real title available?)
- scientific article; zbMATH DE number 1256694 (Why is no real title available?)
- scientific article; zbMATH DE number 512833 (Why is no real title available?)
- scientific article; zbMATH DE number 828046 (Why is no real title available?)
- A Scheme for Fast Parallel Communication
- A Separator Theorem for Planar Graphs
- Applied simulated annealing
- Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
- Efficient Schemes for Parallel Communication
- On forwarding indices of networks
- On the Problem of Partitioning Planar Graphs
- The bisection width of cubic graphs
Cited in
(2)
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)