Self-healing in binomial graph networks

Thara Angskun; George Bosilca; Jack Dongarra

doi:10.1007/978-3-540-76890-6_30

Self-healing in binomial graph networks

Thara Angskun, George Bosilca, Jack Dongarra

Computer Science and Mathematics Div

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases, so does the probability of failure. The logical network topologies must also support the fault-tolerant capability in such dynamic environments. This paper presents a self-healing mechanism to improve the fault-tolerant capability of a Binomial graph (BMG) network. The self-healing mechanism protects BMG from network bisection and helps maintain optimal routing even in failure circumstances. The experimental results show that self-healing with an adaptive method significantly reduces the overhead from reconstructing the networks.

Original language	English
Title of host publication	On the Move to Meaningful Internet Systems 2007
Subtitle of host publication	OTM 2007 Workshops - OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerS
Publisher	Springer Verlag
Pages	1032-1041
Number of pages	10
Edition	PART 2
ISBN (Print)	9783540768890
DOIs	https://doi.org/10.1007/978-3-540-76890-6_30
State	Published - 2007
Event	OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerSys, PPN, RDDS, SSWS, and SWWS 2007 - Vilamoura, Portugal Duration: Nov 25 2007 → Nov 30 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	4806 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerSys, PPN, RDDS, SSWS, and SWWS 2007
Country/Territory	Portugal
City	Vilamoura
Period	11/25/07 → 11/30/07

Access to Document

10.1007/978-3-540-76890-6_30

Cite this

Angskun, T., Bosilca, G., & Dongarra, J. (2007). Self-healing in binomial graph networks. In On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops - OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerS (PART 2 ed., pp. 1032-1041). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4806 LNCS, No. PART 2). Springer Verlag. https://doi.org/10.1007/978-3-540-76890-6_30

Angskun, Thara ; Bosilca, George ; Dongarra, Jack. / Self-healing in binomial graph networks. On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops - OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerS. PART 2. ed. Springer Verlag, 2007. pp. 1032-1041 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).

@inproceedings{6f77478e3f994ce790ca185fa3d28b8b,

title = "Self-healing in binomial graph networks",

abstract = "The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases, so does the probability of failure. The logical network topologies must also support the fault-tolerant capability in such dynamic environments. This paper presents a self-healing mechanism to improve the fault-tolerant capability of a Binomial graph (BMG) network. The self-healing mechanism protects BMG from network bisection and helps maintain optimal routing even in failure circumstances. The experimental results show that self-healing with an adaptive method significantly reduces the overhead from reconstructing the networks.",

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

year = "2007",

doi = "10.1007/978-3-540-76890-6_30",

language = "English",

isbn = "9783540768890",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

number = "PART 2",

pages = "1032--1041",

booktitle = "On the Move to Meaningful Internet Systems 2007",

edition = "PART 2",

note = "OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerSys, PPN, RDDS, SSWS, and SWWS 2007 ; Conference date: 25-11-2007 Through 30-11-2007",

}

Angskun, T, Bosilca, G & Dongarra, J 2007, Self-healing in binomial graph networks. in On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops - OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerS. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 4806 LNCS, Springer Verlag, pp. 1032-1041, OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerSys, PPN, RDDS, SSWS, and SWWS 2007, Vilamoura, Portugal, 11/25/07. https://doi.org/10.1007/978-3-540-76890-6_30

Self-healing in binomial graph networks. / Angskun, Thara; Bosilca, George; Dongarra, Jack.
On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops - OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerS. PART 2. ed. Springer Verlag, 2007. p. 1032-1041 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4806 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Self-healing in binomial graph networks

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. However, as the number of components increases, so does the probability of failure. The logical network topologies must also support the fault-tolerant capability in such dynamic environments. This paper presents a self-healing mechanism to improve the fault-tolerant capability of a Binomial graph (BMG) network. The self-healing mechanism protects BMG from network bisection and helps maintain optimal routing even in failure circumstances. The experimental results show that self-healing with an adaptive method significantly reduces the overhead from reconstructing the networks.

AB - The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases, so does the probability of failure. The logical network topologies must also support the fault-tolerant capability in such dynamic environments. This paper presents a self-healing mechanism to improve the fault-tolerant capability of a Binomial graph (BMG) network. The self-healing mechanism protects BMG from network bisection and helps maintain optimal routing even in failure circumstances. The experimental results show that self-healing with an adaptive method significantly reduces the overhead from reconstructing the networks.

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

U2 - 10.1007/978-3-540-76890-6_30

DO - 10.1007/978-3-540-76890-6_30

M3 - Conference contribution

AN - SCOPUS:38349078377

SN - 9783540768890

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1032

EP - 1041

BT - On the Move to Meaningful Internet Systems 2007

PB - Springer Verlag

T2 - OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerSys, PPN, RDDS, SSWS, and SWWS 2007

Y2 - 25 November 2007 through 30 November 2007

ER -

Angskun T, Bosilca G, Dongarra J. Self-healing in binomial graph networks. In On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops - OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerS. PART 2 ed. Springer Verlag. 2007. p. 1032-1041. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-540-76890-6_30

Self-healing in binomial graph networks

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this