Some Properties of the g-Good-Neighbor (g-Extra) Diagnosability of a Multiprocessor System

HTML  XML Download Download as PDF (Size: 506KB)  PP. 259-266  
DOI: 10.4236/ajcm.2016.63027    1,548 Downloads   2,372 Views  Citations

ABSTRACT

Diagnosability of a multiprocessor system is one important study topic. In 2012, Peng et al. proposed a measure for fault tolerance of the system, which is called the g-good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. In 2015, Zhang et al. proposed a measure for fault diagnosis of the system, namely, g-extra diagnosability, which restrains that every fault-free component has at least g+1 fault-free nodes. In this paper, we obtain some properties of the g-good-neighbor (g-extra) diagnosability of the system and give the g-good-neighbor (g-extra) diagnosability of some graphs under the PMC model and MM* model.

Share and Cite:

Ren, Y. and Wang, S. (2016) Some Properties of the g-Good-Neighbor (g-Extra) Diagnosability of a Multiprocessor System. American Journal of Computational Mathematics, 6, 259-266. doi: 10.4236/ajcm.2016.63027.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.