Abstract
As the size of a multiprocessor system increases, processor failure is inevitable, and fault identification in such a system is crucial for reliable computing. The fault diagnosis is the process of identifying faulty processors in a multiprocessor system through testing. The conditional diagnosability, which is a new metric for evaluating fault tolerance of such systems, assumes that every faulty set does not contain all neighbors of any processor in the systems. This paper shows that the conditional diagnosability of bubble sort graphs B n under the PMC model is 4n-11 for n≥4, which is about four times its ordinary diagnosability under the PMC model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lai, P.-L., Tan, J.J.M., Chang, C.-P., Hsu, L.-H.: Conditional diagnosability measures for large multiprocessor systems. IEEE Transactions on Computers 54(2), 165–175 (2005)
Preparata, F.P., Metze, G., Chien, R.T.: On the connection assignment problem of diagnosable systems. IEEE Transactions on Computers 16, 848–854 (1967)
Xu, M., Thulasiraman, K., Hu, X.: Conditional Diagnosability of Matching Composition Networks Under the PMC Model. IEEE Transactions on Circuits and Systems-II: Express Briefs 56(11), 875–879 (2009)
Zhu, Q.: On conditional diagnosability and reliability of the BC networks. Journal of Supercomputing 45(2), 173–184 (2008)
Xu, M., Hu, X., Shang, S.: The conditional diagnosability of shuffle-cubes. Journal of System Science and Complexity 23, 81–90 (2010)
Zhu, Q., Liu, S.-Y., Xu, M.: On conditional diagnosability of the folded hypercubes. Information Sciences 45, 174–184 (2008)
Chang, N.-W., Hsieh, S.-Y.: Conditional Diagnosability of Augmented Cubes Under the PMC Model. IEEE Transactions on Dependable and Secure Computing 9(1), 46–60 (2012)
Akers, S.B., Kirshnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers 38(4), 555–565 (1989)
Lakshmivarahan, S., Jwo, J., Dhall, S.K.: Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey. Parallel Computing 19(4), 361–407 (1993)
Suzuki, Y., Kaneko, K.: An Algorithm for Disjoint Paths in Bubble-Sort Graphs. Systems and Computers in Japan 37(12), 27–32 (2006)
Araki, T., Kikuchi, Y.: Hamiltonian laceability of bubble-sort graphs with edge faults. Information Sciences 177(13), 2679–2691 (2007)
Kikuchi, Y., Araki, T.: Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs. Information Processing Letters 100, 52–59 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, S., Wang, J., Xu, X., Xu, JM. (2013). Conditional Fault Diagnosis of Bubble Sort Graphs under the PMC Model. In: Du, Z. (eds) Intelligence Computation and Evolutionary Computation. Advances in Intelligent Systems and Computing, vol 180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31656-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-31656-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31655-5
Online ISBN: 978-3-642-31656-2
eBook Packages: EngineeringEngineering (R0)