Subscribe
Issue No.04 - April (2013 vol.62)
pp: 827-831
Rong-Xia Hao , Dept. of Math., Beijing Jiaotong Univ., Beijing, China
Yan-Quan Feng , Dept. of Math., Beijing Jiaotong Univ., Beijing, China
Jin-Xin Zhou , Dept. of Math., Beijing Jiaotong Univ., Beijing, China
ABSTRACT
Let An be the alternating group of degree n with n ≥ 3. Set S = {(1 2 i), (1 i 2)| 3 ≤ i ≤ n}. The alternating group graph, denoted by AGn, is defined as the Cayley graph on An with respect to S. Jwo et al. [Networks 23 (1993) 315-326] introduced alternating group graph AGn as an interconnection network topology for computing systems. Conditional diagnosability, a new measure of diagnosability introduced by Lai et al. [IEEE Transactions on Computers 54(2) (2005) 165-175] can better measure the diagnosability of regular interconnection networks. This paper determines that under PMC-model the conditional diagnosability of AGn is 4 for n = 4 and 6n -18 for each n ≥ 5.
INDEX TERMS
network topology, graph theory, group theory, multiprocessor interconnection networks, regular interconnection networks diagnosis, conditional diagnosability, group graphs, Cayley graph, interconnection network topology, PMC-model, Program processors, Multiprocessing systems, Joining processes, Hypercubes, Fault diagnosis, Periodic structures, alternating group graph, Comparison diagnosis, conditional diaganosability
CITATION
Rong-Xia Hao, Yan-Quan Feng, Jin-Xin Zhou, "Conditional Diagnosability of Alternating Group Graphs", IEEE Transactions on Computers, vol.62, no. 4, pp. 827-831, April 2013, doi:10.1109/TC.2012.15
REFERENCES
 [1] T. Araki and Y. Shibata, "Diagnosability of Networks by the Cartesian Product," IEICE Trans. Fundamentals E83-A, vol. 3, pp. 465-470, 2000. [2] T. Araki and Y. Shibata, "Diagnosability of Butterfly Networks under the Comparison Approach," IEICE Trans. Fundamentals E85-A, vol. 5, pp. 1152-1160, 2002. [3] J.R. Armstrong and F.G. Gray, "Fault Diagnosis in a Boolean n-Cube Array of Multiprocessors," IEEE Trans. Computers, vol. C-30, no. 8, pp. 587-590, Aug. 1981. [4] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. Macmillan Press, 1976. [5] J.-M. Chang and J.-S. Yang, "Panconnectivity, Fault Tolerant Hamiltonicity and Hamiltonian Connectivity in Alternating Group Graphs," Networks, vol. 44, pp. 302-310, 2004. [6] J.-M. Chang and J.-S. Yang, "Fault-Tolerant Cycle-Embedding in Alternating Group Graphs," Applied Math. and Computation, vol. 197, pp. 760-767, 2008. [7] N.-W. Chang and S.-Y. Hsieh, "Conditional Diagnosability of Augmented Cubes under the PMC Model," IEEE Trans. Dependable and Secure Computing, vol. 9, no. 1, pp. 46-60, Jan./Feb. 2012, DOI: 10.1109/TDSC.2010.59. [8] E. Cheng, L. Lipták, and F. Sala, "Linearly Many Faults in 2-Tree-Generated Networks," Networks, vol. 55, pp. 90-98, 2010. [9] K.Y. Chwa and S.L. Hakimi, "On Fault Identification in Diagnosable Systems," IEEE Trans. Computers, vol. 30, no. 6, pp. 414-422, June 1981. [10] A. Esfahanian, "Genralized Measures of Fault Tolerance with Application to $n$ -Cube Networks," IEEE Trans. Computers, vol. 38, no. 11, pp. 1586-1591, Nov. 1989. [11] J. Fan, "Diagnosability of Crossed Cubes under the Two Strategies," Chinese J. Computers, vol. 21, pp. 456-462, 1998. [12] J. Fan, "Diagnosability of the Mobius Cubes," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 923-928, Sept. 1998. [13] J. Fan, "Diagnosability of Crossed Cubes under the Comparison Diagnosis Model," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 7, pp. 687-692, July 2002. [14] G.-H. Hsu, C.-F. Chiang, L.-M. Shih, L.-H. Hsu, and J.J.M. Tan, "Conditional Diagnosability of Hypercubes under the Comparison Diagnosis Model," J. Systems Architecture, vol. 55, pp. 140-146, 2009. [15] S.-Y. Hsieh and T.-Y. Chuang, "The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model," IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 3, pp. 367-378, Mar. 2009. [16] S.-Y. Hsieh and Y.-S. Chen, "Strongly Diagnosable Systems under the Comparison Diagnosis Model," IEEE Trans. Computers, vol. 57, no. 12, pp. 1720-1725, Dec. 2008. [17] S.-Y. Hsieh and Y.-S. Chen, "Strongly Diagnosable Product Networks under the Comparison Diagnosis Model," IEEE Trans. Computers, vol. 57, no. 6, pp. 721-732, June 2008. [18] J.S. Jwo, S. Lakshmivarahan, and S.K. Dhall, "A New Class of Interconnection Networks Based on the Alternating Group," Networks, vol. 23, pp. 315-326, 1993. [19] A. Kavianpour and K.H. Kim, "Diagnosability of Hypercube under the Pessimistic One-Step Diagnosis Strategy," IEEE Trans. Computers, vol. 40, no. 2, pp. 232-237, Feb. 1991. [20] P.-L. Lai, J.J.M. Tan, C.-P. Chang, and L.-H. Hsu, "Conditional Diagnosability Measures for Large Multiprocessor Systems," IEEE Trans. Computers, vol. 54, no. 2, pp. 165-175, Feb. 2005. [21] C.-W. Lee and S.-Y. Hsieh, "Determining the Diagnosability of (1,2)-Matching Composition Networks and Its Applications," IEEE Trans. Dependable and Secure Computing, vol. 8, no. 3, pp. 353-362, May/June 2011. [22] C.K. Lin et al., "Conditional Diagnosability of Cayley Graphs Generalized by Transposition Tree under the Comparison Diagnosis Model," J. Interconnection Networks, vol. 9, pp. 83-97, 2008. [23] J. Maeng and M. Malek, "A Comparison Connection Assignment for Self-Diagnosis of Multiprocessors Systems," Proc. 11th Int'l Symp. Fault-Tolerant Computing, pp. 173-175, 1981. [24] M. Malek, "A Comparison Connection Assignment for Diagnosis of Multiprocessors Systems," Proc. Seventh Ann. Symp. Computer Architecture, pp. 31-36, 1980. [25] J. Meng, "Connectivity of Vertex and Edge Transitive Graphs," Discrete Applied Math., vol. 127, pp. 601-613, 2003. [26] F.P. Preparata, G. Metze, and R.T. Chien, "On the Connection Assignment Problem of Diagnosis Systems," IEEE Trans. Electronic Computers, vol. EC-16, no. 6, pp. 848-854, Dec. 1967. [27] A. Sengupta and A. Dahbura, "On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach," IEEE Trans. Computers, vol. 41, no. 11, pp. 1386-1396, Nov. 1992. [28] Y.-H. Teng, J.J.-M. Tan, and L.-H. Hsu, "Panpositionable Hamiltonicity of the Alternating Group Graphs," Networks, vol. 50, pp. 146-156, 2007. [29] D. Wang, "Diagnosability of Enhanced Hypercubes," IEEE Trans. Computers, vol. 43, no. 9, pp. 1054-1061, Sept. 1994. [30] D. Wang, "Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model," IEEE Trans. Computers, vol. 48, no. 12, pp. 1369-1374, Dec. 1999. [31] M.E. Watkins, "Connectivity of Transitive Graphs," J. Combinatorial Theory, vol. 8, pp. 23-29, 1970. [32] J.-X. Zhou, "The Automorphism Group of the Alternating Group Graph," Applied Math. Letters, vol. 24, pp. 229-231, 2011. [33] S. Zhou and W. Xiao, "Conditional Diagnosability of Alternating Group Networks," Information Processing Letters, vol. 110, pp. 403-409, 2010. [34] Q. Zhu, S.-Y. Liu, and M. Xu, "On Conditional Diagnosability of the Folded Hypercubes," Information Sciences, vol. 178, pp. 1069-1077, 2008.
37 ms
(Ver 2.0)

Marketing Automation Platform