As multiprocessors take on more and increasingly critical tasks, they must be dependable in the presence of faults. Quick and accurate evaluation of both the performance and the dependability of these parallel architectures becomes essential.
The 2-dimensional grid of processors, mesh, can solve effectively linear equations and other scientific problems. A task may need a smaller mesh than the given n × n mesh system. We assume here that a system works as long as one can find a working m × m mesh in the given n × n mesh.
According to the assumption, we discuss the reliability, availability and performance-related dependability of mesh and augmented mesh, torus. Numerical results are validated through simulation. And we compare the reliability and availability of torus with of hypercube. Torus and hypercube has almost same reliability for the same number of nodes.
