The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
HyperX: topology, routing, and packaging of efficient large-scale networks
Abstract
In the push to achieve exascale performance, systems will grow to over 100,000 sockets, as growing cores-per-socket and improved single-core performance provide only part of the speedup needed. These systems will need affordable interconnect structures that scale to this level. To meet the need, we consider an extension of the hypercube and flattened butterfly topologies, the HyperX, and give an adaptive routing algorithm, DAL. HyperX takes advantage of high-radix switch components that integrated photonics will make available. Our main contributions include a formal descriptive framework, enabling a search method that finds optimal HyperX configurations; DAL; and a low cost packaging strategy for an exascale HyperX. Simulations show that HyperX can provide performance as good as a folded Clos, with fewer switches. We also describe a HyperX packaging scheme that reduces system cost. Our analysis of efficiency, performance, and packaging demonstrates that the HyperX is a strong competitor for exascale networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Principles and Practices of Interconnection Networks
Dally, W. J., & Towles, B. (2004) · Cited by 3,260
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402967 · Cited by 3,175
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402967 · Cited by 1,679
Fat-trees: Universal networks for hardware-efficient supercomputing
Leiserson, C. E. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.6312192 · Cited by 1,325
Achieving 100% throughput in an input-queued switch
McKeown, N., Mekkittikul, A., Anantharam, V., & Walrand, J. (1999) · IEEE Transactions on Communications · doi:10.1109/26.780463 · Cited by 838
Corona: System Implications of Emerging Nanophotonic Technology
Vantrease, D., Schreiber, R., Monchiero, M., McLaren, M., Jouppi, N. P., Fiorentino, M., Davis, A., Binkert, N., Beausoleil, R. G., & Ahn, J. H. (2008) · ACM SIGARCH Computer Architecture News · doi:10.1145/1394608.1382135 · Cited by 533
Self-citationTechnology-Driven, Highly-Scalable Dragonfly Topology
Kim, J., Dally, W. J., Scott, S., & Abts, D. (2008) · ACM SIGARCH Computer Architecture News · doi:10.1145/1394608.1382129 · Cited by 487
Corona: System Implications of Emerging Nanophotonic Technology
Vantrease, D., Schreiber, R., Monchiero, M., McLaren, M., Jouppi, N. P., Fiorentino, M., Davis, A., Binkert, N., Beausoleil, R. G., & Ahn, J. H. (2008) · 2008 International Symposium on Computer Architecture · doi:10.1109/isca.2008.35 · Cited by 464
Self-citationFlattened butterfly: a cost-efficient topology for high-radix networks
Kim, J., Dally, W. J., & Abts, D. (2007) · Proceedings of the 34th annual international symposium on Computer architecture · doi:10.1145/1250662.1250679 · Cited by 392
Leveraging Optical Technology in Future Bus-based Chip Multiprocessors
Kirman, N., Kirman, M., Dokania, R., Martínez, J. F., Apsel, A., Watkins, M. A., & Albonesi, D. H. (2006) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2006.28 · Cited by 293
Cited by
DevoFlow: scaling flow management for high-performance networks
Curtis, A. R., Mogul, J. C., Tourrilhes, J., Yalagandula, P., Sharma, P., & Banerjee, S. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018466 · Cited by 959
Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network
Singh, A., Ong, J., Agarwal, A., Anderson, G., Armistead, A., Bannon, R., Boving, S., Desai, G., Felderman, B., Germano, P., et al. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787508 · Cited by 556
DevoFlow: scaling flow management for high-performance networks
Curtis, A. R., Mogul, J. C., Tourrilhes, J., Yalagandula, P., Sharma, P., & Banerjee, S. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2043164.2018466 · Cited by 543
Energy proportional datacenter networks
Abts, D., Marty, M. R., Wells, P. M., Klausler, P., & Liu, H. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1816004 · Cited by 414
Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection
Curtis, A. R., Kim, W., & Yalagandula, P. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5934956 · Cited by 402
Metadata
- Authors
- Ahn, J. H., Binkert, N., Davis, A., McLaren, M., & Schreiber, R. S.
- Venue
- Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
- Publisher
- ACM
- Published
- 2009-11-14
- Pages
- 1-11
- OpenAlex
- W2096811399
- Cited by
- 264
- References
- 10
- FWCI
- 10.53
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: HyperX: topology, routing, and packaging of efficient large-scale networks. https://app.cochat.ai/papers/10.1145/1654059.1654101
- The paper
- Ahn, J. H., Binkert, N., Davis, A., McLaren, M., & Schreiber, R. S. (2009). HyperX: topology, routing, and packaging of efficient large-scale networks. Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis. https://doi.org/10.1145/1654059.1654101
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.