Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In many parallel applications, the need for broadcasting, scattering, gathering or gossiping is crucial. Many collective communication algorithms have been studied for different topologies of interconnection networks such as hypercubes, meshes, De Bruijn and star graphs. In this paper we study some communication procedures on the binary wrapped butterfly BWB(n) of dimension n interconnection networks. We consider the BWB(n) as a point-to-point interconnection network. Communication is assumed to be full duplex, all-ports with a linear communication model and is based on store-and-forward techniques. The BWB(n) is a constant degree 4 Cayley graph. Vadapalli and Srimani gave a new representation of the BWB(n) that bring some convenience in studying the topological properties and fault tolerance. Using this new representation, we propose an improved one-to-all broadcast algorithm, based on a spanning tree of optimal height. We present a technique based on rotative trees for constructing multiple spanning trees that would be used to derive: a fault tolerant one-to-all broadcast, a scattering, a gathering algorithms and theirs fault tolerant version.

Original languageEnglish
Pages (from-to)649-666
Number of pages18
JournalParallel Computing
Volume28
Issue number4
DOIs
Publication statusPublished - Apr 2002

Fingerprint

Interconnection Networks
Fault tolerance
Spanning tree
Fault Tolerance
Disjoint
Binary
Fault-tolerant
Broadcast
Communication
Scattering
De Bruijn Graph
Collective Communication
Gossiping
Star Graph
Parallel Applications
Cayley Graph
Broadcasting
Topological Properties
Hypercube
Mesh

Keywords

  • Broadcasting algorithms
  • Butterfly networks
  • Fault tolerance
  • Interconnection networks
  • Spanning trees

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance. / Touzene, Abderezak.

In: Parallel Computing, Vol. 28, No. 4, 04.2002, p. 649-666.

Research output: Contribution to journalArticle

@article{323f1f7aac9e497a82fc64a6532aef65,
title = "Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance",
abstract = "In many parallel applications, the need for broadcasting, scattering, gathering or gossiping is crucial. Many collective communication algorithms have been studied for different topologies of interconnection networks such as hypercubes, meshes, De Bruijn and star graphs. In this paper we study some communication procedures on the binary wrapped butterfly BWB(n) of dimension n interconnection networks. We consider the BWB(n) as a point-to-point interconnection network. Communication is assumed to be full duplex, all-ports with a linear communication model and is based on store-and-forward techniques. The BWB(n) is a constant degree 4 Cayley graph. Vadapalli and Srimani gave a new representation of the BWB(n) that bring some convenience in studying the topological properties and fault tolerance. Using this new representation, we propose an improved one-to-all broadcast algorithm, based on a spanning tree of optimal height. We present a technique based on rotative trees for constructing multiple spanning trees that would be used to derive: a fault tolerant one-to-all broadcast, a scattering, a gathering algorithms and theirs fault tolerant version.",
keywords = "Broadcasting algorithms, Butterfly networks, Fault tolerance, Interconnection networks, Spanning trees",
author = "Abderezak Touzene",
year = "2002",
month = "4",
doi = "10.1016/S0167-8191(02)00073-X",
language = "English",
volume = "28",
pages = "649--666",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance

AU - Touzene, Abderezak

PY - 2002/4

Y1 - 2002/4

N2 - In many parallel applications, the need for broadcasting, scattering, gathering or gossiping is crucial. Many collective communication algorithms have been studied for different topologies of interconnection networks such as hypercubes, meshes, De Bruijn and star graphs. In this paper we study some communication procedures on the binary wrapped butterfly BWB(n) of dimension n interconnection networks. We consider the BWB(n) as a point-to-point interconnection network. Communication is assumed to be full duplex, all-ports with a linear communication model and is based on store-and-forward techniques. The BWB(n) is a constant degree 4 Cayley graph. Vadapalli and Srimani gave a new representation of the BWB(n) that bring some convenience in studying the topological properties and fault tolerance. Using this new representation, we propose an improved one-to-all broadcast algorithm, based on a spanning tree of optimal height. We present a technique based on rotative trees for constructing multiple spanning trees that would be used to derive: a fault tolerant one-to-all broadcast, a scattering, a gathering algorithms and theirs fault tolerant version.

AB - In many parallel applications, the need for broadcasting, scattering, gathering or gossiping is crucial. Many collective communication algorithms have been studied for different topologies of interconnection networks such as hypercubes, meshes, De Bruijn and star graphs. In this paper we study some communication procedures on the binary wrapped butterfly BWB(n) of dimension n interconnection networks. We consider the BWB(n) as a point-to-point interconnection network. Communication is assumed to be full duplex, all-ports with a linear communication model and is based on store-and-forward techniques. The BWB(n) is a constant degree 4 Cayley graph. Vadapalli and Srimani gave a new representation of the BWB(n) that bring some convenience in studying the topological properties and fault tolerance. Using this new representation, we propose an improved one-to-all broadcast algorithm, based on a spanning tree of optimal height. We present a technique based on rotative trees for constructing multiple spanning trees that would be used to derive: a fault tolerant one-to-all broadcast, a scattering, a gathering algorithms and theirs fault tolerant version.

KW - Broadcasting algorithms

KW - Butterfly networks

KW - Fault tolerance

KW - Interconnection networks

KW - Spanning trees

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

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

U2 - 10.1016/S0167-8191(02)00073-X

DO - 10.1016/S0167-8191(02)00073-X

M3 - Article

VL - 28

SP - 649

EP - 666

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 4

ER -