Abstract
Because of the increasing size of multi-processor systems, processor-fault diagnosis has played critical role in measuring reliability. The diagnosability of numerous well-known multiprocessor systems has been widely investigated. The conditional diagnosability is a new measure of diagnosability by restricting an additional condition under which any fault set cannot contain all the neighbors of any node in a system. This study evaluated the conditional diagnosability for pancake graphs in the PMC model. First, several properties of pancake graphs were derived and, based on these properties, the conditional diagnosability of an n-dimensional pancake graph was shown to be 2 for \(n=3\) and \(8n-21\) for \(n\ge 4\).
Similar content being viewed by others
Data availibility
Not applicable.
References
Akers SB, Krishnamurthy B (1989) A group-theoretic model for symmetric interconnection networks. IEEE Trans Comput 38(4):555–566
Armstrong JR, Gray FG (1981) Fault diagnosis in a boolean \(n\) cube array of multiprocessors. IEEE Trans Comput 30(8):587–590
Chang GY, Chang GJ, Chen GH (2005) Diagnosabilities of regular networks. IEEE Trans Parallel Distrib Syst 16(4):314–323
Chang NW, Hsieh SY (2012) Conditional diagnosability of augmented cubes under the PMC model. IEEE Trans Dependable Secure Comput 9(1):46–60
Chang NW, Hsieh SY (2014) Structural properties and conditional diagnosability of star graphs by using the PMC model. IEEE Trans Parallel Distrib Syst 25(11):3002–3011
Chang NW, Lin TY, Hsieh SY (2012) Conditional diagnosability of \(k\)-ary \(n\)-cubes under the PMC model. ACM Trans Des Autom Electron Syst 17(4):46
Chang NW, Wu HJ, Hsieh SY (2021) “A study for conditional diagnosability of pancake graphs” In: Proceedings of the 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, Lecture Notes in Computer Science: Computing and Combinatorics 13025, pp 298–305
Chen CA, Hsieh SY (2013) \(t/t\)-Diagnosability of regular graphs under the PMC model. ACM Trans Des Autom Electron Syst (TODAES) 18(2):20
Cheng E, Lipman MJ (2012) On deriving conditional diagnosability of interconnection networks. Inf Process Lett 112(17–18):674–677
Dahbura AT, Masson GM (1984) An \(O(n^{2.5})\) fault identification algorithm for diagnosable systems. IEEE Trans Comput 33(6):486–492
Hong WS, Hsieh SY (2012) Strong diagnosability and conditional diagnosability of augmented cubes under the comparison diagnosis model. IEEE Trans Reliab 61(1):140–148
Hsieh SY, Chen YS (2008) Strongly diagnosable product networks under the comparison diagnosis model. IEEE Trans Comput 57(6):721–732
Hsieh SY, Chen YS (2008) Strongly diagnosis systems under the comparison diagnosis model. IEEE Trans Comput 57(12):1720–1725
Hsieh SY, Chuang TY (2013) The strong diagnosability of regular networks and product networks under the PMC model. IEEE Trans Parallel Distrib Syst 62(4):839–843
Hsieh SY, Kao CY (2013) The conditional diagnosability of \(k\)-ary \(n\)-cubes under the comparison diagnosis model. IEEE Trans Comput 62(4):839–843
Hsu GH, Chiang CF, Shih LM, Hsu LH, Tan JJM (2009) Conditional diagnosability of hypercubes under the comparison diagnosis model. J Syst Architect 55(2):140–146
Hsu GH, Tan JJM (2008) Conditional diagnosability of the BC networks under the comparison diagnosis model. Int Comput Symp 1:269–274
Hung C-N, Hsu H-C, Liang K-Y, Hsu L-H (2003) Ring embedding in faulty pancake graphs. Inf Process Lett 86(5):271–275
Kaneko K, Suzuki Y (2003) Node-to-set disjoint paths problem in pancake graphs. IEICE Trans Inf Syst 86(9):1628–1633
Konstantinova E (2013) On Some Structural Properties of Star and Pancake Graphs. In: Information Theory, Combinatorics, and Search Theory. Springer, Berlin Heidelberg, pp 472–487
Konstantinova E, Medvedev A (2014) Small cycles in the Pancake graph. ARS MATHEMATICA CONTEMPORANEA 7(1):237–246
Lai PL, Tan JJM, Chang CP, Hsu LH (2005) Conditional diagnosability measures for large multiprocessor systems. IEEE Trans Comput 54(2):165–175
Lai PL, Tan JJM, Tsai CH, Hsu LH (2004) The diagnosability of the matching composition network under the comparison diagnosis model. IEEE Trans Comput 53(8):1064–1069
Lee CW, Hsieh SY (2011) Diagnosability of two-matching composition networks under the MM model. IEEE Trans Dependable Secure Comput 8(2):246–255
Lee CW, Hsieh SY (2011) Determining the diagnosability of \((1,2)\)-matching composition networks and its applications. IEEE Trans Dependable Secure Comput 8(3):353–362
Lin CK, Kung TL, Tan JJM (2011) 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
Lin CK, Tan JJM, Hsu LH, Cheng E, Lipták L (2008) Conditional diagnosability of Cayley graphs generated by transposition trees. J Interconnect Netw 9(1–2):83–97
Maeng J, Malek M (1981) “A comparison connection assignment for self-diagnosis of multiprocessors systems,” In: Proceedings of the 11th International Symposium on Fault-Tolerant Computing, pp 173–175
Malek M (1980) “A comparison connection assignment for diagnosis of multiprocessors systems,” In: Proceedings of the 7th International Symposium on Computer Architecture, pp 31–36
Nguyen QT, Bettayeb S (2011) On the genus of pancake network. Int Arab J Inf Technol 8(3):289–292
Preparata FP, Metze G, Chien RT (1967) On the connection assignment problem of diagnosis systems. IEEE Trans Electron Comput 16(12):848–854
Suzuki Y, Kaneko K (2003) An algorithm for node-disjoint paths in pancake graphs. IEICE Trans Inf Syst E86–D(3):610–615
Wang D (1999) Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model. IEEE Trans Comput 48(12):1369–1374
Xu M, Thulasiraman K, Hu XD (2009) Conditional diagnosability of matching composition networks under the PMC model. IEEE Trans Circuits Syst II 56(11):875–879
Zheng J, Latifi S, Regentova E, Luo K, Wu X (2005) Diagnosability of star graphs under the comparison diagnosis model. Inf Process Lett 93(1):29–36
Zhou S (2009) “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
Zhou S (2009) “The conditional diagnosability of locally twisted cubes,” In: Proceedings of 2009 4th International Conference on Computer Science and Education, pp 221–226
Zhou S (2009) “The conditional diagnosability of twisted cubes under the comparison model,” In: 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, pp 696–701
Zhou S (2012) The conditional fault diagnosability of \((n, k)\)-star graphs. Appl Math Comput 218(19):9742–9749
Zhou S, Xu L (2013) Conditional fault diagnosability of pancake graphs. J Converg Inf Technol 8(10):668–675
Zhu Q (2008) On conditional diagnosability and reliability of the BC networks. J Supercomput 45(2):173–184
Zhu Q, Liu SY, Xu M (2008) On conditional diagnosability of the folded hypercubes. Inf Sci 178(4):1069–1077
Funding
This paper was supported in part by Ministry of Science and Technology under grant 109-2223-E-006-001-.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing Interests
No conflict of interest exits in the submission of this manuscript.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work was supported in part by Ministry of Science and Technology under grant 109-2223-E-006-001-.
The preliminary version of this manuscript has been published in Chang et al. (2021).
Appendix
Appendix
1.1 Proofs of \(t_c(\mathcal{P}_3)=2\) and \(t_c(\mathcal{P}_4)=11\)
As show in Fig. 17, \(\mathcal{P}_3\) is not conditionally 3-diagnosable and \(\mathcal{P}_4\) is not conditionally 12-diagnosable. Hence, \(t_c(\mathcal{P}_3)\le 2\) and \(t_c(\mathcal{P}_4) \le 11\). Because the 3-dimensional pancake graph \(\mathcal{P}_3\) is isomorphic to the 3-dimensional star graph \(S_3\), according to the result shown in Chang et al. (2005), the diagnosability of \(S_3\) is 2. Hence, \(t(\mathcal{P}_3)= 2\). Moreover, according to Lemma 8, \(t_c(\mathcal{P}_3)\ge 2\), which leads \(t_c(\mathcal{P}_3)=2\).
For \(\mathcal{P}_4\), let \(F_1, F_2 \subset V(\mathcal{P}_4)\) be an indistinguishable conditional-pair, and let \(T = F_1 \cap F_2\). According to Lemma 10, \(\mathcal{P}_4 {\setminus } T\) has a component H with \(V(H)\subseteq F_1\varDelta F_2\), which implies that \(|F_1{\setminus } F_2|\ge \left\lceil \frac{|V(H)|}{2}\right\rceil \) or \(|F_2{\setminus } F_1|\ge \left\lceil \frac{|V(H)|}{2}\right\rceil \); hence, \(|F_1|\ge |T|+ \left\lceil \frac{|V(H)|}{2}\right\rceil \) or \(|F_2|\ge |T|+ \left\lceil \frac{|V(H)|}{2}\right\rceil \). Therefore, only\(|T|+ \left\lceil \frac{|V(H)|}{2}\right\rceil \ge 12\) must be proven.
If \(\mathcal{P}_4 {\setminus } T\) is connected, let H be the only component in \(\mathcal{P}_4 {\setminus } T\). Therefore,
Otherwise, \(\mathcal{P}_4 {\setminus } T\) is disconnected. Based on the size of |T|, the following scenarios are considered.
- Case 1::
-
\(|T|\le 3\).
According to Lemma 4, \(\mathcal{P}_4 {\setminus } T\) has a large component and at most one trivial component. According to Lemma 9, the components in \(\mathcal{P}_4 {\setminus } T\) are all non-trivial. Hence, \(\mathcal{P}_4 {\setminus } T\) is connected, which leads to a contradiction.
- Case 2::
-
\(|T|=4\).
According to Lemma 5, \(\mathcal{P}_4 {\setminus } T\) has a large component and at most two small components containing up to 2 nodes in total. Because \((F_1,F_2)\) is an indistinguishable conditional-pair, according to Lemma 10, \(\mathcal{P}_4 {\setminus } T\) has a component H such that \(|V(H)|\ge 8\). Clearly, H is a large component such that \(|V(H)|\ge 4! -|T|-2 \ge 18\) and \(|T|+\left\lceil \frac{|V(H)|}{2}\right\rceil \ge 4+\left\lceil \frac{18}{2}\right\rceil \ge 13\).
- Case 3::
-
\(5 \le |T|\le 6\).
This case can be verified through an exhaustive search using a computer program. For \(|T|=5\), \(V(H)\ge 16\). Hence, \(|T|+\left\lceil \frac{|V(H)|}{2}\right\rceil \ge 5+\left\lceil \frac{16}{2}\right\rceil \ge 13\). For \(|T|=6\), \(V(H)\ge 12\). Hence, \(|T|+\left\lceil \frac{|V(H)|}{2}\right\rceil \ge 6+\left\lceil \frac{12}{2}\right\rceil \ge 12\).
- Case 4::
-
\(|T|=7\).
According to Lemma 10, \(\mathcal{P}_4 {\setminus } T\) has a component H such that \(V(H)\ge 8\) and H contains a path of length 7 S as a subgraph. According to Lemma 6, \(|N_{\mathcal{P}_4}(S)|\ge 8\), and \(N_{\mathcal{P}_4}(S)\) belongs to \(H \cup T\). Because \(|T|=7\), at least one node exists in \(N_{\mathcal{P}_4}(S)\) that belongs to H, where \(|V(H)|\ge 9\). Therefore, \(|T|+\left\lceil \frac{|V(H)|}{2}\right\rceil \ge 7+\left\lceil \frac{9}{2}\right\rceil \ge 12\).
- Case 5::
-
\(|T|\ge 8\).
Because \(V(H)\ge 8\), \(|T|+\left\lceil \frac{|V(H)|}{2}\right\rceil \ge 8+\left\lceil \frac{8}{2}\right\rceil \ge 12\).
According to the above all cases, because \(|T|+\left\lceil \frac{|V(H)|}{2}\right\rceil \ge 12 > 11\), \(|F_1| >11\) or \(|F_2| >11\). According to Lemma 7, \(\mathcal{P}_4\) is conditionally 11-diagnosable (i.e., \(t_c(\mathcal{P}_4) \ge 11\)). Hence, \(t_c(\mathcal{P}_4)=11\). \(\square \)
Rights and permissions
About this article
Cite this article
Chang, NW., Wu, HJ. & Hsieh, SY. Pancake graphs: Structural properties and conditional diagnosability. J Comb Optim 44, 3263–3293 (2022). https://doi.org/10.1007/s10878-022-00877-8
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-022-00877-8