RECORD
Node-Type-Based Load-Balancing Routing for Parallel Generalized Fat-Trees
Distributed, Parallel, and Cluster Computing · Submitted 21 Nov 2022
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show how it removes these performance issues by comparing results in a variety of situations against corresponding classical algorithms.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
High-Performance Computing (HPC) clusters are made up of a variety of node types (usually compute, I/O, service, and GPGPU nodes) and applications don't use nodes of a different type the same way. Resulting communication patterns reflect organization of groups of nodes, and current optimal routing algorithms for all-to-all patterns will not always maximize performance for group-specific communications. Since application communication patterns are rarely available beforehand, we choose to rely on node types as a good guess for node usage. We provide a description of node type heterogeneity and analyse performance degradation caused by unlucky repartition of nodes of the same type. We provide an extension to routing algorithms for Parallel Generalized Fat-Tree topologies (PGFTs) which balances load amongst groups of nodes of the same type. We show how it removes these performance issues by comparing results in a variety of situations against corresponding classical algorithms.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | High-Performance Computing (HPC) clusters are made up of a variety of node types (usually compute, I/O, service, and GPGPU nodes) and applications don't use nodes of a different type the same way. | background 1.00 | 0.07 | 0.03 | asserted 1.00 |
| s1 | Resulting communication patterns reflect organization of groups of nodes, and current optimal routing algorithms for all-to-all patterns will not always maximize performance for group-specific communications. | background 0.68 | 0.15 | 0.06 | hedged possibility 0.53 |
| s2 | Since application communication patterns are rarely available beforehand, we choose to rely on node types as a good guess for node usage. | method 0.74 | 0.53 | 0.05 | asserted 0.81 |
| s3 | We provide a description of node type heterogeneity and analyse performance degradation caused by unlucky repartition of nodes of the same type. | contribution 0.99 | 0.91 | 0.06 | asserted 0.92 |
| s4 | We provide an extension to routing algorithms for Parallel Generalized Fat-Tree topologies (PGFTs) which balances load amongst groups of nodes of the same type. | contribution 0.88 | 0.95 | 0.26 | asserted 0.99 |
| s5 | We show how it removes these performance issues by comparing results in a variety of situations against corresponding classical algorithms. | result 0.93 | 0.95 | 0.66 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
High-Performance Computing (HPC) clusters are made up of a variety of node types (usually compute, I/O, service, and GPGPU nodes) and applications don't use nodes of a different type the same way. Resulting communication patterns reflect organization of groups of nodes, and current optimal routing algorithms for all-to-all patterns will not always maximize performance for group-specific communications. Since application communication patterns are rarely available beforehand, we choose to rely on node types as a good guess for node usage. We provide a description of node type heterogeneity and analyse performance degradation caused by unlucky repartition of nodes of the same type. We provide an extension to routing algorithms for Parallel Generalized Fat-Tree topologies (PGFTs) which balances load amongst groups of nodes of the same type. We show how it removes these performance issues by comparing results in a variety of situations against corresponding classical algorithms.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.