The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Flattened butterfly: a cost-efficient topology for high-radix networks
Abstract
Increasing integrated-circuit pin bandwidth has motivateda corresponding increase in the degree or radix of interconnection networksand their routers. This paper introduces the flattened butterfly, a cost-efficient topology for high-radix networks. On benign (load-balanced) traffic, the flattened butterfly approaches the cost/performance of a butterfly network and has roughly half the cost of a comparable performance Clos network.The advantage over the Clos is achieved by eliminating redundant hopswhen they are not needed for load balance. On adversarial traffic, the flattened butterfly matches the cost/performance of a folded-Clos network and provides an order of magnitude better performance than a conventional butterfly.In this case, global adaptive routing is used to switchthe flattened butterfly from minimal to non-minimal routing - usingredundant hops only when they are needed. Minimal and non-minimal, oblivious and adaptive routing algorithms are evaluated on the flattened butterfly.We show that load-balancing adversarial traffic requires non-minimalglobally-adaptive routing and show that sequential allocators are required to avoid transient load imbalance when using adaptive routing algorithms.We also compare the cost of the flattened butterfly to folded-Clos, hypercube,and butterfly networks with identical capacityand show that the flattened butterfly is more cost-efficient thanfolded-Clos and hypercube topologies.
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
Ladner, R. E., & Fischer, M. J. (1980) · Journal of the ACM · doi:10.1145/322217.322232 · Cited by 1,281
Dally, W. J. (1992) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.127260 · Cited by 1,156
Self-citationPerformance analysis of k-ary n-cube interconnection networks
Dally, W. J. (1990) · IEEE Transactions on Computers · doi:10.1109/12.53599 · Cited by 887
Self-citationGeneralized Hypercube and Hyperbus Structures for a Computer Network
Bhuyan, & Agrawal (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676437 · Cited by 855
Dally, 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
Dynamic voltage scaling with links for power optimization of interconnection networks
Shang, L., Peh, L.-S., & Jha, N. K. (2003) · The Ninth International Symposium on High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings. · doi:10.1109/hpca.2003.1183527 · Cited by 455
Energy optimization techniques in cluster interconnects
Kim, E. J., Yum, K. H., Link, G., et al. (2003) · International Symposium on Low Power Electronics and Design (ISLPED) · doi:10.1145/871506.871620 · Cited by 96
Cited by
Opinion mining and sentiment analysis
Pang, B., & Lee, L. (2008) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000011 · Cited by 6,372
Outstanding Research Problems in NoC Design: System, Microarchitecture, and Circuit Perspectives
Marculescu, R., Ogras, U. Y., Peh, L.-S., Jerger, N. E., & Hoskote, Y. (2009) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2008.2010691 · Cited by 683
Technology-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
Self-citationEnergy 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
Self-citationMahout: 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
- Kim, J., Dally, W. J., & Abts, D.
- Venue
- Proceedings of the 34th annual international symposium on Computer architecture
- Publisher
- ACM
- Published
- 2007-06-09
- Pages
- 126-137
- ISSN
- 1063-6897 (ISSN-L)
- OpenAlex
- W2025177582
- Cited by
- 392
- References
- 10
- FWCI
- 11.84
- 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: Flattened butterfly: a cost-efficient topology for high-radix networks. https://app.cochat.ai/papers/10.1145/1250662.1250679
- The paper
- Kim, J., Dally, W. J., & Abts, D. (2007). Flattened butterfly: a cost-efficient topology for high-radix networks. Proceedings of the 34th annual international symposium on Computer architecture. https://doi.org/10.1145/1250662.1250679
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.