Abstract
If we only care about the status of a particular vertex, instead of doing global diagnosis, Hsu and Tan introduced the concept of local diagnosis and proposed an extended star structure to diagnose a vertex under comparison model. Usually, there is a gap between the local diagnosability and the lower bound guaranteed by the extended star structure mentioned above. In this paper, we propose a new testing structure and corresponding diagnosis algorithm to diagnose a vertex under comparison model to better evaluate the local diagnosability. The local diagnosability of a vertex is upper bounded by its degree in the system. If the local diagnosability of each vertex equals to its degree in the system then we say this system has the strong local diagnosability property. Based on the new structure, we show that the n-dimensional star graph \(S_n\) with faulty links has the strong local diagnosability property provided that each vertex connects to at least three fault-free links. Simulations are presented to show the performance of our tree structure.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akers, S.B., Krishnameurthy, B.: Group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555–566 (1989)
Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)
Chiang, C.F., Hsu, G.H., Shih, L.M., Tan, J.J.M.: Diagnosability of star graphs with missing edges. Inf. Sci. 188, 253–259 (2012)
Chiang, C.F., Tan, J.J.M.: Using node diagnosability to determine \(t\)-diagnosability under the comparison diagnosis model. IEEE Trans. Comput. 58(1), 251–259 (2009)
Chwa, K.-Y., Hakimi, S.L.: Schemes for fault tolerant computing: a comparison of modularly redundant and \(t\)-diagnosable systems. Inf. Control 49, 212–238 (1981)
Hsu, G.H., Tan, J.J.M.: A local diagnosability measure for multiprocessor systems. IEEE Trans. Parallel Distrib. Syst. 18, 598–607 (2007)
Hsu, L.-H., Lin, C.-K.: Graph Theory and Interconnection Networks. CRC Press, Boca Raton (2009)
Maeng, J., Malek, M.: A comparison connection assignment for diagnosis of multiprocessor systems. In: Proceedings of the 11th International Symposium on Fault-Tolerant Computing, pp. 173–175 (1981)
Malek, M.: A comparison connection assignment for diagnosis of multiprocessor systems. In: Proceedings of the 7th Annual Symposium on Computer Architecture, pp. 31–35 (1980)
Peng, S.-L., Lin, C.-K., Tan, J.J.M., Hsu, L.-H.: The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model. Appl. Math. Comput. 218(21), 10406–10412 (2012)
Preparata, F.P., Metze, G., Chien, R.T.: On the connection assignment problem of diagnosable systems. IEEE Trans. Electron. Comput. 16(12), 848–854 (1967)
Sengupta, A., Dahbura, A.T.: On self-diagnosable multiprocessor systems: diagnosis by the comparison approach. IEEE Trans. Comput. 41(11), 1386–1396 (1992)
Acknowledgment
This work was supported by Shin Kong Wu Ho Su Memorial Hospital National Yang Ming Chiao Tung University Joint Research Program (111-SKH-NYCU-03) and Fujian Provincial Department of Science and Technology (2020J01268).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Chen, M., Lin, CK., Pai, KJ. (2022). A Tree Structure for Local Diagnosis in Multiprocessor Systems Under Comparison Model. In: Hsieh, SY., Hung, LJ., Klasing, R., Lee, CW., Peng, SL. (eds) New Trends in Computer Technologies and Applications. ICS 2022. Communications in Computer and Information Science, vol 1723. Springer, Singapore. https://doi.org/10.1007/978-981-19-9582-8_5
Download citation
DOI: https://doi.org/10.1007/978-981-19-9582-8_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-9581-1
Online ISBN: 978-981-19-9582-8
eBook Packages: Computer ScienceComputer Science (R0)