A task-based dependability model for k-Ary n-cubes

A. S. Vaidya, B. S. Yoo, C. R. Das, J. Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations


Dependability (reliability and availability) modeling of k-Ary n-cube architectures is addressed in this paper. The dependability model considered here is known as task-based dependability because the system working condition is specified by the task requirement. For the k-Ary n-cube, we therefore compute the probability of finding a working k-Ary m-cube. Due to the complexity of the problem, a structural decomposition technique is used to develop the analytical model. Two probability terms care required for computing either reliability or availability. The first term finds the probability that there are x working nodes in the system. Computation of this term for the availability analysis needs the solution of a simple Markov chain. The second term finds the probability that the x working nodes form the required subcube, called the task connection probability. A recursive expression, is developed for this. Analytical results are provided for various system configurations and task requirements. It is shown through simulation that the analytical model is quite accurate.

Original languageEnglish (US)
Title of host publicationArchitecture
EditorsA. Reeves
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages8
ISBN (Electronic)081867623X
StatePublished - 1996
Event25th International Conference on Parallel Processing, ICPP 1996 - Ithaca, United States
Duration: Aug 12 1996Aug 16 1996

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918


Other25th International Conference on Parallel Processing, ICPP 1996
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • Software
  • General Mathematics
  • Hardware and Architecture


Dive into the research topics of 'A task-based dependability model for k-Ary n-cubes'. Together they form a unique fingerprint.

Cite this