Unsafety vectors

A new fault-tolerant routing for k-ary n-cubes

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

K-ary n-cubes have been one of the most common networks for multicomputers due to their desirable properties, such as ease of implementation and ability to exploit communication locality found in many parallel applications. This paper presents a new fault-tolerant routing algorithm for k-ary n-cubes. The algorithm is based on the concept of 'unsafety vectors', which measures the 'degree' of unsafety to reach a given destination node. Extensive simulation reveals that for practical number of faulty nodes, the proposed fault-tolerant routing algorithm achieves good performance in terms of the routing distance and percentage of reachability.

Original languageEnglish
Pages (from-to)239-246
Number of pages8
JournalMicroprocessors and Microsystems
Volume25
Issue number5
DOIs
Publication statusPublished - Aug 20 2001

Fingerprint

Routing algorithms
Communication

Keywords

  • Fault-tolerant routing
  • Interconnection networks
  • k-Ary n-Cube
  • Multicomputers
  • Performance evaluation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Unsafety vectors : A new fault-tolerant routing for k-ary n-cubes. / Al-Sadi, Jehad; Day, Khaled; Ould-Khaoua, Mohamed.

In: Microprocessors and Microsystems, Vol. 25, No. 5, 20.08.2001, p. 239-246.

Research output: Contribution to journalArticle

@article{3a1262e1a448476aa61541a998634783,
title = "Unsafety vectors: A new fault-tolerant routing for k-ary n-cubes",
abstract = "K-ary n-cubes have been one of the most common networks for multicomputers due to their desirable properties, such as ease of implementation and ability to exploit communication locality found in many parallel applications. This paper presents a new fault-tolerant routing algorithm for k-ary n-cubes. The algorithm is based on the concept of 'unsafety vectors', which measures the 'degree' of unsafety to reach a given destination node. Extensive simulation reveals that for practical number of faulty nodes, the proposed fault-tolerant routing algorithm achieves good performance in terms of the routing distance and percentage of reachability.",
keywords = "Fault-tolerant routing, Interconnection networks, k-Ary n-Cube, Multicomputers, Performance evaluation",
author = "Jehad Al-Sadi and Khaled Day and Mohamed Ould-Khaoua",
year = "2001",
month = "8",
day = "20",
doi = "10.1016/S0141-9331(01)00117-X",
language = "English",
volume = "25",
pages = "239--246",
journal = "Microprocessors and Microsystems",
issn = "0141-9331",
publisher = "Elsevier",
number = "5",

}

TY - JOUR

T1 - Unsafety vectors

T2 - A new fault-tolerant routing for k-ary n-cubes

AU - Al-Sadi, Jehad

AU - Day, Khaled

AU - Ould-Khaoua, Mohamed

PY - 2001/8/20

Y1 - 2001/8/20

N2 - K-ary n-cubes have been one of the most common networks for multicomputers due to their desirable properties, such as ease of implementation and ability to exploit communication locality found in many parallel applications. This paper presents a new fault-tolerant routing algorithm for k-ary n-cubes. The algorithm is based on the concept of 'unsafety vectors', which measures the 'degree' of unsafety to reach a given destination node. Extensive simulation reveals that for practical number of faulty nodes, the proposed fault-tolerant routing algorithm achieves good performance in terms of the routing distance and percentage of reachability.

AB - K-ary n-cubes have been one of the most common networks for multicomputers due to their desirable properties, such as ease of implementation and ability to exploit communication locality found in many parallel applications. This paper presents a new fault-tolerant routing algorithm for k-ary n-cubes. The algorithm is based on the concept of 'unsafety vectors', which measures the 'degree' of unsafety to reach a given destination node. Extensive simulation reveals that for practical number of faulty nodes, the proposed fault-tolerant routing algorithm achieves good performance in terms of the routing distance and percentage of reachability.

KW - Fault-tolerant routing

KW - Interconnection networks

KW - k-Ary n-Cube

KW - Multicomputers

KW - Performance evaluation

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

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

U2 - 10.1016/S0141-9331(01)00117-X

DO - 10.1016/S0141-9331(01)00117-X

M3 - Article

VL - 25

SP - 239

EP - 246

JO - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

SN - 0141-9331

IS - 5

ER -