Edge-disjoint spanning trees for the generalized butterfly networks and their applications

Abderezak Touzene, Khaled Day, Burkhard Monien

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

The generalized butterfly GBN(d,n) has recently gained some interest as a point-to-point interconnection network rather than the well known multi-stage butterfly networks. We construct edges-disjoint spanning trees (abbreviated EDSTs) for the GBN(d,n). Our construction is based on the decomposition of the GBN(d,n) into dn vertex-disjoint cycles of length n. As an application, we propose an efficient broadcasting algorithm and its fault-tolerant version for the GBN(d,n). Our fault-tolerant broadcasting algorithm is optimal in terms of fault-tolerance, because it resists 2d-1 edge failures (2d is the degree of the GBN(d,n)). We also propose an efficient scattering algorithm and its fault-tolerant version which resists 2d-3 edge faults.

Original languageEnglish
Pages (from-to)1384-1396
Number of pages13
JournalJournal of Parallel and Distributed Computing
Volume65
Issue number11
DOIs
Publication statusPublished - Nov 2005

Fingerprint

Spanning tree
Fault-tolerant
Disjoint
Broadcasting
Resist
Interconnection Networks
Fault tolerance
Fault Tolerance
Fault
Scattering
Decomposition
Cycle
Decompose
Vertex of a graph

Keywords

  • Broadcast
  • Butterfly networks
  • Edge-disjoint trees
  • Fault-tolerance
  • Interconnection networks
  • Spanning trees

ASJC Scopus subject areas

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

Cite this

Edge-disjoint spanning trees for the generalized butterfly networks and their applications. / Touzene, Abderezak; Day, Khaled; Monien, Burkhard.

In: Journal of Parallel and Distributed Computing, Vol. 65, No. 11, 11.2005, p. 1384-1396.

Research output: Contribution to journalArticle

@article{bce491820de849c785fadc83fb998b89,
title = "Edge-disjoint spanning trees for the generalized butterfly networks and their applications",
abstract = "The generalized butterfly GBN(d,n) has recently gained some interest as a point-to-point interconnection network rather than the well known multi-stage butterfly networks. We construct edges-disjoint spanning trees (abbreviated EDSTs) for the GBN(d,n). Our construction is based on the decomposition of the GBN(d,n) into dn vertex-disjoint cycles of length n. As an application, we propose an efficient broadcasting algorithm and its fault-tolerant version for the GBN(d,n). Our fault-tolerant broadcasting algorithm is optimal in terms of fault-tolerance, because it resists 2d-1 edge failures (2d is the degree of the GBN(d,n)). We also propose an efficient scattering algorithm and its fault-tolerant version which resists 2d-3 edge faults.",
keywords = "Broadcast, Butterfly networks, Edge-disjoint trees, Fault-tolerance, Interconnection networks, Spanning trees",
author = "Abderezak Touzene and Khaled Day and Burkhard Monien",
year = "2005",
month = "11",
doi = "10.1016/j.jpdc.2005.05.009",
language = "English",
volume = "65",
pages = "1384--1396",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "11",

}

TY - JOUR

T1 - Edge-disjoint spanning trees for the generalized butterfly networks and their applications

AU - Touzene, Abderezak

AU - Day, Khaled

AU - Monien, Burkhard

PY - 2005/11

Y1 - 2005/11

N2 - The generalized butterfly GBN(d,n) has recently gained some interest as a point-to-point interconnection network rather than the well known multi-stage butterfly networks. We construct edges-disjoint spanning trees (abbreviated EDSTs) for the GBN(d,n). Our construction is based on the decomposition of the GBN(d,n) into dn vertex-disjoint cycles of length n. As an application, we propose an efficient broadcasting algorithm and its fault-tolerant version for the GBN(d,n). Our fault-tolerant broadcasting algorithm is optimal in terms of fault-tolerance, because it resists 2d-1 edge failures (2d is the degree of the GBN(d,n)). We also propose an efficient scattering algorithm and its fault-tolerant version which resists 2d-3 edge faults.

AB - The generalized butterfly GBN(d,n) has recently gained some interest as a point-to-point interconnection network rather than the well known multi-stage butterfly networks. We construct edges-disjoint spanning trees (abbreviated EDSTs) for the GBN(d,n). Our construction is based on the decomposition of the GBN(d,n) into dn vertex-disjoint cycles of length n. As an application, we propose an efficient broadcasting algorithm and its fault-tolerant version for the GBN(d,n). Our fault-tolerant broadcasting algorithm is optimal in terms of fault-tolerance, because it resists 2d-1 edge failures (2d is the degree of the GBN(d,n)). We also propose an efficient scattering algorithm and its fault-tolerant version which resists 2d-3 edge faults.

KW - Broadcast

KW - Butterfly networks

KW - Edge-disjoint trees

KW - Fault-tolerance

KW - Interconnection networks

KW - Spanning trees

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

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

U2 - 10.1016/j.jpdc.2005.05.009

DO - 10.1016/j.jpdc.2005.05.009

M3 - Article

VL - 65

SP - 1384

EP - 1396

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 11

ER -