Abstract
Due to the increasing size of a multi-processor system, processor fault diagnosis has played an important role in measuring the reliability of the system. The diagnosability of many well-known multiprocessor systems has been widely investigated. The conditional diagnosability is a new measure of diagnosability by restricting an additional condition that any faulty set cannot contain all the neighbors of any node in a system. In this paper, we evaluate the conditional diagnosability for pancake graphs under the PMC model. We first derive several properties of pancake graphs, and then based on these properties, the conditional diagnosability of an n-dimensional pancake graph is shown to be 2 for \(n=3\) and \(8n-21\) for \(n\ge 4\).
Supported by the Ministry of Science and Technology in Taiwan.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555–566 (1989)
Chang, G.Y., Chang, G.J., Chen, G.H.: Diagnosabilities of regular networks. IEEE Trans. Parallel Distrib. Syst. 16(4), 314–323 (2005)
Chang, N.W., Hsieh, S.Y.: Conditional diagnosability of augmented cubes under the PMC model. IEEE Trans. Dependable Secur. Comput. 9(1), 46–60 (2012)
Chang, N.W., Hsieh, S.Y.: Structure properties and conditional diagnosability of star graphs under the PMC model. IEEE Trans. Parallel Distrib. Syst. 25, 1–11 (2014)
Chang, N.W., Lin, T.Y., Hsieh, S.Y.: Conditional diagnosability of \(k\)-ary \(n\)-cubes under the PMC model. ACM Trans. Des. Autom. Electron. Syst. 17(4), 46 (2012)
Chen, C.A., Hsieh, S.Y.: t/t-Diagnosability of regular graphs under the PMC model. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 18(2), 20 (2013)
Dahbura, A.T., Masson, G.M.: An \(O(n^{2.5})\) fault identification algorithm for diagnosable systems. IEEE Trans. Comput. 33(6), 486–492 (1984)
Hong, W.S., Hsieh, S.Y.: Strong diagnosability and conditional diagnosability of augmented cubes under the comparison diagnosis model. IEEE Trans. Reliab. 61(1), 140–148 (2012)
Hsieh, S.Y., Chen, Y.S.: Strongly diagnosable product networks under the comparison diagnosis model. IEEE Trans. Comput. 57(6), 721–732 (2008)
Hsieh, S.Y., Chen, Y.S.: Strongly diagnosis systems under the comparison diagnosis model. IEEE Trans. Comput. 57(12), 1720–1725 (2008)
Hsieh, S.Y., Chuang, T.Y.: The strong diagnosability of regular networks and product networks under the PMC model. IEEE Trans. Parallel Distrib. Syst. 20(3), 367–378 (2009)
Hsieh, S.Y., Kao, C.Y.: The conditional diagnosability of \(k\)-ary \(n\)-cubes under the comparison diagnosis model. IEEE Trans. Comput. 62(4), 839–843 (2013)
Hsu, G.H., Chiang, C.F., Shih, L.M., Hsu, L.H., Tan, J.J.M.: Conditional diagnosability of hypercubes under the comparison diagnosis model. J. Syst. Architect. 55(2), 140–146 (2009)
Hsu, G.H., Tan, J.J.M.: Conditional diagnosability of the BC networks under the comparison diagnosis model. Int. Comput. Symp. 1, 269–274 (2008)
Hung, C.N., Hsu, H.C., Liang, K.-Y., Hsu, L.-H.: Ring embedding in faulty pancake graphs. Inf. Process. Lett. 86(5), 271–275 (2003)
Kaneko, K., Suzuki, Y.: Node-to-set disjoint paths problem in pancake graphs. IEICE Trans. Inf. Syst. 86(9), 1628–1633 (2003)
Konstantinova, E.: On some structural properties of star and pancake graphs. In: Aydinian, H., Cicalese, F., Deppe, C. (eds.) Information Theory, Combinatorics, and Search Theory. LNCS, vol. 7777, pp. 472–487. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36899-8_23
Konstantinova, E., Medvedev, A.: Small cycles in the pancake graph. ARS Math. Contemporanea 7, 237–246 (2014)
Lai, P.L., Tan, J.J.M., Chang, C.P., Hsu, L.H.: Conditional diagnosability measures for large multiprocessor systems. IEEE Trans. Comput. 54(2), 165–175 (2005)
Lai, P.L., Tan, J.J.M., Tsai, C.H., Hsu, L.H.: The diagnosability of the matching composition network under the comparison diagnosis model. IEEE Trans. Comput. 53(8), 1064–1069 (2004)
Lee, C.W., Hsieh, S.Y.: Diagnosability of two-matching composition networks under the MM model. IEEE Trans. Dependable Secur. Comput. 8(2), 246–255 (2011)
Lin, C.K., Kung, T.L., Tan, J.J.M.: Conditional-fault diagnosability of multiprocessor systems with an efficient local diagnosis algorithm under the PMC model. IEEE Trans. Parallel Distrib. Syst. 22(10), 1669–1680 (2011)
Lin, C.K., Tan, J.J.M., Hsu, L.H., Cheng, E., Lipták, L.: Conditional diagnosability of Cayley graphs generated by transposition trees. J. Interconnection Netw. 9(1–2), 83–97 (2008)
Maeng, J., Malek, M.: A comparison connection assignment for self-diagnosis of multiprocessors 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 multiprocessors systems. In: Proceedings of the 7th International Symposium on Computer Architecture, pp. 31–36 (1980)
Nguyen, Q.T., Bettayeb, S.: On the genus of pancake network. Int. Arab. J. Inf. Technol. 8(3), 289–292 (2011)
Preparata, F.P., Metze, G., Chien, R.T.: On the connection assignment problem of diagnosis systems. IEEE Trans. Electron. Comput. 16(12), 848–854 (1967)
Suzuki, Y., Kaneko, K.: An algorithm for node-disjoint paths in pancake graphs. IEICE Trans. Inf. Syst. E86–D(3), 610–615 (2003)
Wang, D.: Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model. IEEE Trans. Comput. 48, 1369–1374 (1999)
Xu, M., Thulasiraman, K., Hu, X.D.: Conditional diagnosability of matching composition networks under the PMC model. IEEE Trans. Circ. Syst. II 56(11), 875–879 (2009)
Zheng, J., Latifi, S., Regentova, E., Luo, K., Wu, X.: Diagnosability of star graphs under the comparison diagnosis model. Inf. Process. Lett. 93(1), 29–36 (2005)
Zhou, S.: The conditional diagnosability of Möbius cubes under the comparison model. In: Proceedings of the 2009 IEEE International Conference on Information and Automation, pp. 96–100 (2009)
Zhu, Q.: On conditional diagnosability and reliability of the BC networks. J. Supercomput. 45(2), 173–184 (2008)
Zhu, Q., Liu, S.Y., Xu, M.: On conditional diagnosability of the folded hypercubes. Inf. Sci. 178(4), 1069–1077 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Chang, NW., Wu, HJ., Hsieh, SY. (2021). A Study for Conditional Diagnosability of Pancake Graphs. In: Chen, CY., Hon, WK., Hung, LJ., Lee, CW. (eds) Computing and Combinatorics. COCOON 2021. Lecture Notes in Computer Science(), vol 13025. Springer, Cham. https://doi.org/10.1007/978-3-030-89543-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-030-89543-3_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-89542-6
Online ISBN: 978-3-030-89543-3
eBook Packages: Computer ScienceComputer Science (R0)