Unsafety vectors: A new fault-tolerant routing for k-ary n-cubes

Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


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
Issue number5
Publication statusPublished - Aug 20 2001


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

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'Unsafety vectors: A new fault-tolerant routing for k-ary n-cubes'. Together they form a unique fingerprint.

Cite this