92 research outputs found
PolarStar: Expanding the Scalability Horizon of Diameter-3 Networks
Full text linkIn this paper, we present PolarStar, a novel family of diameter-3 network
topologies derived from the star product of two low-diameter factor graphs. The
proposed PolarStar construction gives the largest known diameter-3 network
topologies for almost all radixes. When compared to state-of-the-art diameter-3
networks, PolarStar achieves 31% geometric mean increase in scale over
Bundlefly, 91% over Dragonfly, and 690% over 3-D HyperX.
PolarStar has many other desirable properties including a modular layout,
large bisection, high resilience to link failures and a large number of
feasible sizes for every radix. Our evaluation shows that it exhibits
comparable or better performance than other diameter-3 networks under various
traffic patterns.Comment: 13 pages, 13 figures, 4 table
Bounds on distance measures in graphs and altered graphs
Get PDFAbstract: Please refer to full text to view abstract.D.Phil. (Mathematics and Applied Mathematics
LIPIcs, Volume 261, ICALP 2023, Complete Volume
Get PDFLIPIcs, Volume 261, ICALP 2023, Complete Volum
LIPIcs, Volume 248, ISAAC 2022, Complete Volume
Get PDFLIPIcs, Volume 248, ISAAC 2022, Complete Volum
27th Annual European Symposium on Algorithms: ESA 2019, September 9-11, 2019, Munich/Garching, Germany
Get PDFCollection of abstracts of the 24th European Workshop on Computational Geometry
Get PDFInternational audienceThe 24th European Workshop on Computational Geomety (EuroCG'08) was held at INRIA Nancy - Grand Est & LORIA on March 18-20, 2008. The present collection of abstracts contains the 63 scientific contributions as well as three invited talks presented at the workshop
- …
