Binomial graph: A scalable and fault-tolerant logical network topology

Thara Angskun; George Bosilca; Jack Dongarra

doi:10.1007/978-3-540-74742-0_43

Binomial graph: A scalable and fault-tolerant logical network topology

Thara Angskun, George Bosilca, Jack Dongarra

Research output: Chapter in Book/Conference proceeding › Conference contribution

Abstract

The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also support the high degree of scalability in dynamic environments. This paper presents a scalable and fault tolerant topology called binomial graph (BMG). BMG provides desirable topological properties in terms of both scalability and fault-tolerance for high performance computing such as reasonable degree, regular graph, low diameter, symmetric graph, low cost factor, low message traffic density, optimal connectivity, low fault-diameter and strongly resilient. Several fault-tolerant routing algorithms are provided on BMG for various message types. More importantly, BMG is able to deliver broadcast messages from any node within log2 (n) steps. © Springer-Verlag Berlin Heidelberg 2007.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\|Lect. Notes Comput. Sci.
Publisher	Springer Nature
Pages	471-482
Number of pages	11
Volume	4742
ISBN (Print)	3540747419, 9783540747413
DOIs	https://doi.org/10.1007/978-3-540-74742-0_43
Publication status	Published - 2007
Event	5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007 - Niagara Falls Duration: 1 Jul 2007 → … http://dblp.uni-trier.de/db/conf/ispa/ispa2007.html#AngskunBD07http://dblp.uni-trier.de/rec/bibtex/conf/ispa/AngskunBD07.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/ispa/AngskunBD07

Publication series

Name	Lecture Notes in Computer Science

Conference

Conference	5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007
City	Niagara Falls
Period	1/07/07 → …
Internet address	http://dblp.uni-trier.de/db/conf/ispa/ispa2007.html#AngskunBD07http://dblp.uni-trier.de/rec/bibtex/conf/ispa/AngskunBD07.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/ispa/AngskunBD07

Access to Document

10.1007/978-3-540-74742-0_43

Cite this

Angskun, T., Bosilca, G., & Dongarra, J. (2007). Binomial graph: A scalable and fault-tolerant logical network topology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci. (Vol. 4742, pp. 471-482). (Lecture Notes in Computer Science). Springer Nature. https://doi.org/10.1007/978-3-540-74742-0_43

@inproceedings{e9e5f3b860b2496bb7f9acc753449137,

title = "Binomial graph: A scalable and fault-tolerant logical network topology",

abstract = "The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also support the high degree of scalability in dynamic environments. This paper presents a scalable and fault tolerant topology called binomial graph (BMG). BMG provides desirable topological properties in terms of both scalability and fault-tolerance for high performance computing such as reasonable degree, regular graph, low diameter, symmetric graph, low cost factor, low message traffic density, optimal connectivity, low fault-diameter and strongly resilient. Several fault-tolerant routing algorithms are provided on BMG for various message types. More importantly, BMG is able to deliver broadcast messages from any node within log2 (n) steps. {\textcopyright} Springer-Verlag Berlin Heidelberg 2007.",

author = "Thara Angskun and George Bosilca and Jack Dongarra",

year = "2007",

doi = "10.1007/978-3-540-74742-0\_43",

language = "English",

isbn = "3540747419",

volume = "4742",

series = "Lecture Notes in Computer Science",

publisher = "Springer Nature",

pages = "471--482",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.",

address = "United States",

note = "5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007 ; Conference date: 01-07-2007",

url = "http://dblp.uni-trier.de/db/conf/ispa/ispa2007.html\#AngskunBD07http://dblp.uni-trier.de/rec/bibtex/conf/ispa/AngskunBD07.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/ispa/AngskunBD07",

}

Angskun, T, Bosilca, G & Dongarra, J 2007, Binomial graph: A scalable and fault-tolerant logical network topology. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 4742, Lecture Notes in Computer Science, Springer Nature, pp. 471-482, 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007, Niagara Falls, 1/07/07. https://doi.org/10.1007/978-3-540-74742-0_43

Binomial graph: A scalable and fault-tolerant logical network topology. / Angskun, Thara; Bosilca, George; Dongarra, Jack.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. Vol. 4742 Springer Nature, 2007. p. 471-482 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Conference proceeding › Conference contribution

TY - GEN

T1 - Binomial graph: A scalable and fault-tolerant logical network topology

AU - Angskun, Thara

AU - Bosilca, George

AU - Dongarra, Jack

PY - 2007

Y1 - 2007

N2 - The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also support the high degree of scalability in dynamic environments. This paper presents a scalable and fault tolerant topology called binomial graph (BMG). BMG provides desirable topological properties in terms of both scalability and fault-tolerance for high performance computing such as reasonable degree, regular graph, low diameter, symmetric graph, low cost factor, low message traffic density, optimal connectivity, low fault-diameter and strongly resilient. Several fault-tolerant routing algorithms are provided on BMG for various message types. More importantly, BMG is able to deliver broadcast messages from any node within log2 (n) steps. © Springer-Verlag Berlin Heidelberg 2007.

AB - The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also support the high degree of scalability in dynamic environments. This paper presents a scalable and fault tolerant topology called binomial graph (BMG). BMG provides desirable topological properties in terms of both scalability and fault-tolerance for high performance computing such as reasonable degree, regular graph, low diameter, symmetric graph, low cost factor, low message traffic density, optimal connectivity, low fault-diameter and strongly resilient. Several fault-tolerant routing algorithms are provided on BMG for various message types. More importantly, BMG is able to deliver broadcast messages from any node within log2 (n) steps. © Springer-Verlag Berlin Heidelberg 2007.

U2 - 10.1007/978-3-540-74742-0_43

DO - 10.1007/978-3-540-74742-0_43

M3 - Conference contribution

SN - 3540747419

SN - 9783540747413

VL - 4742

T3 - Lecture Notes in Computer Science

SP - 471

EP - 482

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.

PB - Springer Nature

T2 - 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007

Y2 - 1 July 2007

ER -

Angskun T, Bosilca G, Dongarra J. Binomial graph: A scalable and fault-tolerant logical network topology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. Vol. 4742. Springer Nature. 2007. p. 471-482. (Lecture Notes in Computer Science). doi: 10.1007/978-3-540-74742-0_43

Binomial graph: A scalable and fault-tolerant logical network topology

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this