@inproceedings{a48d5fb254d54b4c8e9d0578e3df5660,

title = "A task-based dependability model for k-Ary n-cubes",

abstract = "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.",

author = "Vaidya, {A. S.} and Yoo, {B. S.} and Das, {C. R.} and J. Kim",

note = "Funding Information: *This research was supportedin part by the National Science Foundation under Grant No. MIP-9406984. Publisher Copyright: {\textcopyright} 1996 IEEE.; 25th International Conference on Parallel Processing, ICPP 1996 ; Conference date: 12-08-1996 Through 16-08-1996",

year = "1996",

doi = "10.1109/ICPP.1996.537137",

language = "English (US)",

series = "Proceedings of the International Conference on Parallel Processing",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "9--16",

editor = "A. Reeves",

booktitle = "Architecture",

address = "United States",

}