A case for random shortcut topologies for HPC interconnects

Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano, D. Frank Hsu, Henri Casanova

研究成果: Conference contribution

77 引用 (Scopus)

抄録

As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance Computing (HPC) systems can exploit low-latency topologies of high-radix switches. In this context, we propose the use of random shortcut topologies, which are generated by augmenting classical topologies with random links. Using graph analysis we find that these topologies, when compared to non-random topologies of the same degree, lead to drastically reduced diameter and average shortest path length. The best results are obtained when adding random links to a ring topology, meaning that good random shortcut topologies can easily be generated for arbitrary numbers of switches. Using flit-level discrete event simulation we find that random shortcut topologies achieve throughput comparable to and latency lower than that of existing non-random topologies such as hypercubes and tori. Finally, we discuss and quantify practical challenges for random shortcut topologies, including routing scalability and larger physical cable lengths.

元の言語English
ホスト出版物のタイトルProceedings - International Symposium on Computer Architecture
ページ177-188
ページ数12
DOI
出版物ステータスPublished - 2012
イベント2012 39th Annual International Symposium on Computer Architecture, ISCA 2012 - Portland, OR, United States
継続期間: 2012 6 92012 6 13

Other

Other2012 39th Annual International Symposium on Computer Architecture, ISCA 2012
United States
Portland, OR
期間12/6/912/6/13

Fingerprint

Topology
Switches
Discrete event simulation
Scalability
Cables
Throughput
Communication

ASJC Scopus subject areas

  • Hardware and Architecture

これを引用

Koibuchi, M., Matsutani, H., Amano, H., Hsu, D. F., & Casanova, H. (2012). A case for random shortcut topologies for HPC interconnects. : Proceedings - International Symposium on Computer Architecture (pp. 177-188). [6237016] https://doi.org/10.1109/ISCA.2012.6237016

A case for random shortcut topologies for HPC interconnects. / Koibuchi, Michihiro; Matsutani, Hiroki; Amano, Hideharu; Hsu, D. Frank; Casanova, Henri.

Proceedings - International Symposium on Computer Architecture. 2012. p. 177-188 6237016.

研究成果: Conference contribution

Koibuchi, M, Matsutani, H, Amano, H, Hsu, DF & Casanova, H 2012, A case for random shortcut topologies for HPC interconnects. : Proceedings - International Symposium on Computer Architecture., 6237016, pp. 177-188, 2012 39th Annual International Symposium on Computer Architecture, ISCA 2012, Portland, OR, United States, 12/6/9. https://doi.org/10.1109/ISCA.2012.6237016
Koibuchi M, Matsutani H, Amano H, Hsu DF, Casanova H. A case for random shortcut topologies for HPC interconnects. : Proceedings - International Symposium on Computer Architecture. 2012. p. 177-188. 6237016 https://doi.org/10.1109/ISCA.2012.6237016
Koibuchi, Michihiro ; Matsutani, Hiroki ; Amano, Hideharu ; Hsu, D. Frank ; Casanova, Henri. / A case for random shortcut topologies for HPC interconnects. Proceedings - International Symposium on Computer Architecture. 2012. pp. 177-188
@inproceedings{eaea805e6fce49fabf62c5318f7db173,
title = "A case for random shortcut topologies for HPC interconnects",
abstract = "As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance Computing (HPC) systems can exploit low-latency topologies of high-radix switches. In this context, we propose the use of random shortcut topologies, which are generated by augmenting classical topologies with random links. Using graph analysis we find that these topologies, when compared to non-random topologies of the same degree, lead to drastically reduced diameter and average shortest path length. The best results are obtained when adding random links to a ring topology, meaning that good random shortcut topologies can easily be generated for arbitrary numbers of switches. Using flit-level discrete event simulation we find that random shortcut topologies achieve throughput comparable to and latency lower than that of existing non-random topologies such as hypercubes and tori. Finally, we discuss and quantify practical challenges for random shortcut topologies, including routing scalability and larger physical cable lengths.",
keywords = "diameter, high performance computing, high-radix switches, interconnection networks, Topology",
author = "Michihiro Koibuchi and Hiroki Matsutani and Hideharu Amano and Hsu, {D. Frank} and Henri Casanova",
year = "2012",
doi = "10.1109/ISCA.2012.6237016",
language = "English",
isbn = "9781467304757",
pages = "177--188",
booktitle = "Proceedings - International Symposium on Computer Architecture",

}

TY - GEN

T1 - A case for random shortcut topologies for HPC interconnects

AU - Koibuchi, Michihiro

AU - Matsutani, Hiroki

AU - Amano, Hideharu

AU - Hsu, D. Frank

AU - Casanova, Henri

PY - 2012

Y1 - 2012

N2 - As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance Computing (HPC) systems can exploit low-latency topologies of high-radix switches. In this context, we propose the use of random shortcut topologies, which are generated by augmenting classical topologies with random links. Using graph analysis we find that these topologies, when compared to non-random topologies of the same degree, lead to drastically reduced diameter and average shortest path length. The best results are obtained when adding random links to a ring topology, meaning that good random shortcut topologies can easily be generated for arbitrary numbers of switches. Using flit-level discrete event simulation we find that random shortcut topologies achieve throughput comparable to and latency lower than that of existing non-random topologies such as hypercubes and tori. Finally, we discuss and quantify practical challenges for random shortcut topologies, including routing scalability and larger physical cable lengths.

AB - As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance Computing (HPC) systems can exploit low-latency topologies of high-radix switches. In this context, we propose the use of random shortcut topologies, which are generated by augmenting classical topologies with random links. Using graph analysis we find that these topologies, when compared to non-random topologies of the same degree, lead to drastically reduced diameter and average shortest path length. The best results are obtained when adding random links to a ring topology, meaning that good random shortcut topologies can easily be generated for arbitrary numbers of switches. Using flit-level discrete event simulation we find that random shortcut topologies achieve throughput comparable to and latency lower than that of existing non-random topologies such as hypercubes and tori. Finally, we discuss and quantify practical challenges for random shortcut topologies, including routing scalability and larger physical cable lengths.

KW - diameter

KW - high performance computing

KW - high-radix switches

KW - interconnection networks

KW - Topology

UR - http://www.scopus.com/inward/record.url?scp=84864830758&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864830758&partnerID=8YFLogxK

U2 - 10.1109/ISCA.2012.6237016

DO - 10.1109/ISCA.2012.6237016

M3 - Conference contribution

AN - SCOPUS:84864830758

SN - 9781467304757

SP - 177

EP - 188

BT - Proceedings - International Symposium on Computer Architecture

ER -