Diagnosabilities of regular networks

TL;DR

This paper investigates the diagnosability of regular multiprocessor networks under two models and strategies, providing key results for systems like hypercubes, enhancing understanding of system reliability.

Contribution

It determines diagnosabilities of regular networks under various models and strategies, including widely used multiprocessor systems, extending existing diagnosability theory.

Findings

Diagnosability results for regular networks under PMC and comparison models

Analysis of precise and pessimistic diagnosis strategies

Application to hypercube variants and similar systems

Abstract

In this paper, we study diagnosabilities of multiprocessor systems under two diagnosis models: the PMC model and the comparison model. In each model, we further consider two different diagnosis strategies: the precise diagnosis strategy proposed by Preparata et al. and the pessimistic diagnosis strategy proposed by Friedman. The main result of this paper is to determine diagnosabilities of regular networks with certain conditions, which include several widely used multiprocessor systems such as variants of hypercubes and many others.