The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Technology-Driven, Highly-Scalable Dragonfly Topology
Abstract
Evolving technology and increasing pin-bandwidth motivate the use of high-radix routers to reduce the diameter, latency, and cost of interconnection networks. High-radix networks, however, require longer cables than their low-radix counterparts. Because cables dominate network cost, the number of cables, and particularly the number of long, global cables should be minimized to realize an efficient network. In this paper, we introduce the dragonfly topology which uses a group of high-radix routers as a virtual router to increase the effective radix of the network. With this organization, each minimally routed packet traverses at most one global channel. By reducing global channels, a dragonfly reduces cost by 20% compared to a flattened butterfly and by 52% compared to a folded Clos network in configurations with ≥ 16K nodes.We also introduce two new variants of global adaptive routing that enable load-balanced routing in the dragonfly. Each router in a dragonfly must make an adaptive routing decision based on the state of a global channel connected to a different router. Because of the indirect nature of this routing decision, conventional adaptive routing algorithms give degraded performance. We introduce the use of selective virtual-channel discrimination and the use of credit round-trip latency to both sense and signal channel congestion. The combination of these two methods gives throughput and latency that approaches that of an ideal adaptive routing algorithm.
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
Self-citationFat-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
Dally, W. J. (1992) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.127260 · Cited by 1,156
Self-citationDally, W. J. (2002) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.1990.134508 · Cited by 777
Self-citationThe SGI Origin: a ccNUMA highly scalable server
Laudon, J., & Lenoski, D. (1997) · Proceedings of the 24th annual international symposium on Computer architecture · doi:10.1145/264107.264206 · Cited by 775
Flattened 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
Self-citationBuilding Ultralow-Latency Interconnection Networks Using Photonic Integration
Shacham, A., & Bergman, K. (2007) · IEEE Micro · doi:10.1109/mm.2007.64 · Cited by 64
Design of a High-Speed Optical Interconnect for Scalable Shared-Memory Multiprocessors
Kodi, A. K., & Louri, A. (2005) · IEEE Micro · doi:10.1109/mm.2005.7 · Cited by 38
Cited by
Jellyfish: Networking Data Centers Randomly
Singla, A., Hong, C.-Y., Popa, L., & Godfrey, P. B. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.1687 · Cited by 357
HyperX: topology, routing, and packaging of efficient large-scale networks
Ahn, J. H., Binkert, N., Davis, A., McLaren, M., & Schreiber, R. S. (2009) · Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis · doi:10.1145/1654059.1654101 · Cited by 264
The Convergence of Hyperscale Data Center and High-Performance Computing Networks
Hoefler, T., Hendel, A., & Roweth, D. (2022) · Computer · doi:10.1109/mc.2022.3158437 · Cited by 30
Metadata
- Authors
- Kim, J., Dally, W. J., Scott, S., & Abts, D.
- Venue
- ACM SIGARCH Computer Architecture News
- Published
- 2008-06
- Volume
- 36
- Issue
- 3
- Pages
- 77-88
- ISSN
- 0163-5964 (ISSN-L)
- OpenAlex
- W2155187164
- Cited by
- 487
- References
- 8
- FWCI
- 19.20
- Type
- journal article
- 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: Technology-Driven, Highly-Scalable Dragonfly Topology. https://app.cochat.ai/papers/10.1145/1394608.1382129
- The paper
- Kim, J., Dally, W. J., Scott, S., & Abts, D. (2008). Technology-Driven, Highly-Scalable Dragonfly Topology. ACM SIGARCH Computer Architecture News. https://doi.org/10.1145/1394608.1382129
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.