Projective Networks: Topologies for Large Parallel Computer Systems
read the original abstract
The interconnection network comprises a significant portion of the cost of large parallel computers, both in economic terms and power consumption. Several previous proposals exploit large-radix routers to build scalable low-distance topologies with the aim of minimizing these costs. However, they fail to consider potential unbalance in the network utilization, which in some cases results in suboptimal designs. Based on an appropriate cost model, this paper advocates the use of networks based on incidence graphs of projective planes, broadly denoted as Projective Networks. Projective Networks rely on highly symmetric generalized Moore graphs and encompass several proposed direct (PN and demi-PN) and indirect (OFT) topologies under a common mathematical framework. Compared to other proposals with average distance between 2 and 3 hops, these networks provide very high scalability while preserving a balanced network utilization, resulting in low network costs. Overall, Projective Networks constitute a competitive alternative for exascale-level interconnection network design.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Multi-Orientation Edge-Minimum Repair for Non-Redundant Fault-Tolerant Broadcasting in Dense Eisenstein--Jacobi Networks
EJ-MOEM repairs fault-pruned broadcast trees in dense EJ networks by proving that c-1 external edges suffice when the component graph is connected and that repair depth is at most t+2 for two faults.
-
Multi-Orientation Edge-Minimum Repair for Non-Redundant Fault-Tolerant Broadcasting in Dense Gaussian Networks
Introduces multi-orientation edge-minimum repair (MOEM) for non-redundant fault-tolerant one-to-all broadcast in dense Gaussian networks generated by α=k+(k+1)i, proving use of c-1 repair edges and depth at most k+2 f...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.