Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs
From MaRDI portal
Publication:2009644
Recommendations
Cites work
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303526 (Why is no real title available?)
- A framework for solving VLSI graph layout problems
- Assignment of Numbers to Vertices
- Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- On the mathematics of data centre network topologies
- Optimal Assignments of Numbers to Vertices
Cited in
(3)
This page was built for publication: Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009644)