Simulations and fitted analytical models project that the UpDown fine-grained architecture could reach roughly 500K to 1M GTEPS for PageRank and BFS at graph scale 40, but the abstract's specific 637K PR figure does not appear in the body.
PolarFly: A Cost-Effective and Flexible Low-Diameter Topology
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper we present PolarFly, a diameter-2 network topology based on the Erdos-Renyi family of polarity graphs from finite geometry. This is a highly scalable low-diameter topology that asymptotically reaches the Moore bound on the number of nodes for a given network degree and diameter PolarFly achieves high Moore bound efficiency even for the moderate radixes commonly seen in current and near-future routers, reaching more than 96% of the theoretical peak. It also offers more feasible router degrees than the state-of-the-art solutions, greatly adding to the selection of scalable diameter-2 networks. PolarFly enjoys many other topological properties highly relevant in practice, such as a modular design and expandability that allow incremental growth in network size without rewiring the whole network. Our evaluation shows that PolarFly outperforms competitive networks in terms of scalability, cost and performance for various traffic patterns.
fields
cs.DC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
How Fast Can Graph Computations Go on Fine-grained Parallel Architectures
Simulations and fitted analytical models project that the UpDown fine-grained architecture could reach roughly 500K to 1M GTEPS for PageRank and BFS at graph scale 40, but the abstract's specific 637K PR figure does not appear in the body.