The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Fat-trees: Universal networks for hardware-efficient supercomputing
Abstract
The author presents a new class of universal routing networks, called fat-trees, which might be used to interconnect the processors of a general-purpose parallel supercomputer. A fat-tree routing network is parameterized not only in the number of processors, but also in the amount of simultaneous communication it can support. Since communication can be scaled independently from the number of processors, substantial hardware can be saved for such applications as finite-element analysis without resorting to a special-purpose architecture. It is proved that a fat-tree of a given size is nearly the best routing network of that size. This universality theorem is established using a three-dimensional VLSI model that incorporates wiring as a direct cost. In this model, hardware size is measured as physical volume. It is proved that for any given amount of communications hardware, a fat-tree built from that amount of hardware can stimulate every other network built from the same amount of hardware, using only slightly more time (a polylogarithmic factor greater).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Hillis, W. D. (1987) · Scientific American · doi:10.1038/scientificamerican0687-108 · Cited by 1,635
A Separator Theorem for Planar Graphs
Lipton, R. J., & Tarjan, R. E. (1979) · SIAM Journal on Applied Mathematics · doi:10.1137/0136016 · Cited by 1,359
Parallel Processing with the Perfect Shuffle
Stone, H. S. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223205 · Cited by 1,245
NETL: A System for Representing and Using Real-World Knowledge
Fahlman, S. E. (1979) · OLAC - Open Language Archives Community · Cited by 524
Waksman, A. (1968) · Journal of the ACM · doi:10.1145/321439.321449 · Cited by 459
A framework for solving VLSI graph layout problems
Bhatt, S. N., & Leighton, F. T. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90071-0 · Cited by 438
Universality considerations in VLSI circuits
Valiant, L. G. (1981) · IEEE Transactions on Computers · doi:10.1109/tc.1981.6312176 · Cited by 396
Tight Bounds on the Complexity of Parallel Sorting
Leighton, T. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.5009385 · Cited by 368
Bhatt, S. N., & Leiserson, C. E. (1984) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 60
Self-citation
Cited by
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
A survey of research and practices of Network-on-chip
Bjerregaard, T., & Mahadevan, S. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132953 · Cited by 1,648
BCube: a high performance, server-centric network architecture for modular data centers
Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., & Lu, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592577 · Cited by 1,372
Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement
Meng, X., Pappas, V., & Zhang, L. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461930 · Cited by 935
Metadata
- Authors
- Leiserson, C. E.
- Venue
- IEEE Transactions on Computers
- Published
- 1985-10
- Volume
- C-34
- Issue
- 10
- Pages
- 892-901
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2042876290
- Cited by
- 1,325
- References
- 9
- FWCI
- 9.02
- 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
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.