Interconnection Networks for Parallel and Distributed Processing
Interconnection Networks for Parallel and Distributed Processing
Dependability: A Unifying Concept for Reliable, Safe, Secure Computing
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Allocation and Mapping Based Reliability Analysis of Multistage Interconnection Networks
IEEE Transactions on Computers
On Dependability Evaluation of Mesh-Connected Processors
IEEE Transactions on Computers
Mathematics and Computers in Simulation
| Hi-index | 0.01 |
System decomposition is a novel technique for modeling the dependability of complexsystems without constructing a single-level Markov Chain (MC). This is demonstrated inthis paper for the availability computation of a class of multiprocessors that uses 4*4switching elements for the multistage interconnection network (MIN). The availabilitymodel is known as task-based availability, where a system is considered operational aslong as the task requirements are satisfied. The authors develop two simple MC's for theprocessors and memories and solve them using a software package, called HARP. Theprobabilities of i processing elements (PE's) and j memory modules (MM's) working at any time t, denoted as Pi(t) and Pj(t), are obtained from their corresponding MC's. The effect of the MIN is captured in the model by finding the number of switches required for the connection of i PE's and j MM's. A third MC is then developed for the switches to find the probability that the MIN provides the required (i*j) connection. Multiplying this term with Pi(t) and Pj(t), the probability of an (i*j) working group is obtained. The methodology is generalized to model arbitrary as well as larger size systems. Transient and steady state availabilities are computed for a variety of MIN configurations and then validated through simulation.