Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

The need for collective communication procedures such as One-to-All broadcast, All-to-All broadcast arises in many parallel or distributed applications. Many of these communication procedures have been studied for many topologies of interconnection networks such as hypercubes, meshes, De Bruijn, star graphs and butterflies. In this paper we propose a construction of multiple edge-disjoint spanning trees for the k-ary n-cube which can be used to derive an optimal and fault tolerant broadcasting algorithm. We propose also an optimal All-to-All broadcasting algorithm. We consider the k-ary n-cube as a point-to-point interconnection, using store-and-forward, all-port assumption and a linear communication model.

Original languageEnglish
Pages (from-to)221-231
Number of pages11
JournalJournal of Systems Architecture
Volume50
Issue number4
DOIs
Publication statusPublished - Mar 2004

Fingerprint

Broadcasting
Communication
Stars
Topology

Keywords

  • Broadcast
  • Edge-disjoint spanning trees
  • Fault tolerance
  • Interconnection networks

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

@article{6a8646a2b3804098885ebecb57bff1ca,
title = "Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks",
abstract = "The need for collective communication procedures such as One-to-All broadcast, All-to-All broadcast arises in many parallel or distributed applications. Many of these communication procedures have been studied for many topologies of interconnection networks such as hypercubes, meshes, De Bruijn, star graphs and butterflies. In this paper we propose a construction of multiple edge-disjoint spanning trees for the k-ary n-cube which can be used to derive an optimal and fault tolerant broadcasting algorithm. We propose also an optimal All-to-All broadcasting algorithm. We consider the k-ary n-cube as a point-to-point interconnection, using store-and-forward, all-port assumption and a linear communication model.",
keywords = "Broadcast, Edge-disjoint spanning trees, Fault tolerance, Interconnection networks",
author = "Abderezak Touzene",
year = "2004",
month = "3",
doi = "10.1016/j.sysarc.2003.09.003",
language = "English",
volume = "50",
pages = "221--231",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks

AU - Touzene, Abderezak

PY - 2004/3

Y1 - 2004/3

N2 - The need for collective communication procedures such as One-to-All broadcast, All-to-All broadcast arises in many parallel or distributed applications. Many of these communication procedures have been studied for many topologies of interconnection networks such as hypercubes, meshes, De Bruijn, star graphs and butterflies. In this paper we propose a construction of multiple edge-disjoint spanning trees for the k-ary n-cube which can be used to derive an optimal and fault tolerant broadcasting algorithm. We propose also an optimal All-to-All broadcasting algorithm. We consider the k-ary n-cube as a point-to-point interconnection, using store-and-forward, all-port assumption and a linear communication model.

AB - The need for collective communication procedures such as One-to-All broadcast, All-to-All broadcast arises in many parallel or distributed applications. Many of these communication procedures have been studied for many topologies of interconnection networks such as hypercubes, meshes, De Bruijn, star graphs and butterflies. In this paper we propose a construction of multiple edge-disjoint spanning trees for the k-ary n-cube which can be used to derive an optimal and fault tolerant broadcasting algorithm. We propose also an optimal All-to-All broadcasting algorithm. We consider the k-ary n-cube as a point-to-point interconnection, using store-and-forward, all-port assumption and a linear communication model.

KW - Broadcast

KW - Edge-disjoint spanning trees

KW - Fault tolerance

KW - Interconnection networks

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

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

U2 - 10.1016/j.sysarc.2003.09.003

DO - 10.1016/j.sysarc.2003.09.003

M3 - Article

VL - 50

SP - 221

EP - 231

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 4

ER -