Pith. sign in

REVIEW 1 cited by

PolarFly: A Cost-Effective and Flexible Low-Diameter Topology

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.01695 v4 pith:J3A2TJIJ submitted 2022-08-02 cs.NI cs.DC

classification cs.NIcs.DC
keywords polarflynetworktopologybounddiameter-2highlylow-diametermoore
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. How Fast Can Graph Computations Go on Fine-grained Parallel Architectures

    cs.DC 2025-07 reject novelty 6.0 of 10

    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 n...

Pith tools