메뉴 건너뛰기




Volumn 110, Issue 10, 2010, Pages 403-409

Conditional diagnosability of alternating group networks

Author keywords

Alternating group network; Comparison diagnosis; Conditional diagnosability

Indexed keywords

COMPARISON DIAGNOSIS; COMPARISON MODELS; COMPONENT FAILURES; CONDITIONAL DIAGNOSABILITY; FAULT DIAGNOSIS; FAULTY PROCESSORS; HIGH RELIABILITY; LARGEST CONNECTED COMPONENT; MULTI PROCESSOR SYSTEMS; NETWORKED SYSTEMS;

EID: 77949879207     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.03.010     Document Type: Article
Times cited : (46)

References (27)
  • 1
    • 84938017623 scopus 로고
    • On the connection assignment problem of diagnosable systems
    • Preparata F.P., Metze G., and Chien R.T. On the connection assignment problem of diagnosable systems. IEEE Trans. Comput. 16 (1967) 848-854
    • (1967) IEEE Trans. Comput. , vol.16 , pp. 848-854
    • Preparata, F.P.1    Metze, G.2    Chien, R.T.3
  • 5
    • 85057120598 scopus 로고
    • A comparison connection assignment for diagnosis of multiprocessor systems
    • M. Malek, A comparison connection assignment for diagnosis of multiprocessor systems, in: Proc. 7th Int. Symp. Computer Architecture, 1980, pp. 31-35
    • (1980) Proc. 7th Int. Symp. Computer Architecture , pp. 31-35
    • Malek, M.1
  • 6
    • 84939348330 scopus 로고
    • On fault identification in diagnosable system
    • Chwa K.Y., and Hakimi S.L. On fault identification in diagnosable system. IEEE Trans. Comput. C-30 6 (1981) 414-422
    • (1981) IEEE Trans. Comput. , vol.C-30 , Issue.6 , pp. 414-422
    • Chwa, K.Y.1    Hakimi, S.L.2
  • 7
    • 0019696801 scopus 로고
    • A comparison connection assignment for self-diagnosis of multiprocessor systems
    • J. Maeng, M. Malek, A comparison connection assignment for self-diagnosis of multiprocessor systems, in: Proc. 11th Internat. Fault-Tolerant Computing, 1981, pp. 173-175
    • (1981) Proc. 11th Internat. Fault-Tolerant Computing , pp. 173-175
    • Maeng, J.1    Malek, M.2
  • 8
    • 0000070179 scopus 로고
    • On self-diagnosable multiprocessor systems: diagnosis by comparison approach
    • Sengupta A., and Dahbura A. On self-diagnosable multiprocessor systems: diagnosis by comparison approach. IEEE Trans. Comput. 41 (1992) 1386-1396
    • (1992) IEEE Trans. Comput. , vol.41 , pp. 1386-1396
    • Sengupta, A.1    Dahbura, A.2
  • 9
    • 0033337677 scopus 로고    scopus 로고
    • Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model
    • Wang D. Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model. IEEE Trans. Comput. 48 (1999) 1369-1374
    • (1999) IEEE Trans. Comput. , vol.48 , pp. 1369-1374
    • Wang, D.1
  • 10
    • 0036807211 scopus 로고    scopus 로고
    • Diagnosability of crossed cubes under the comparison diagnosis model
    • Fan J. Diagnosability of crossed cubes under the comparison diagnosis model. IEEE Trans. Parallel Distrib. Syst. 13 (2002) 1099-1104
    • (2002) IEEE Trans. Parallel Distrib. Syst. , vol.13 , pp. 1099-1104
    • Fan, J.1
  • 13
    • 51949117671 scopus 로고    scopus 로고
    • Conditional diagnosability of Cayley graphs generalized by transposition tree under the comparison diagnosis model
    • Lin C.K., et al. Conditional diagnosability of Cayley graphs generalized by transposition tree under the comparison diagnosis model. Journal of Interconnection Networks 9 (2008) 83-97
    • (2008) Journal of Interconnection Networks , vol.9 , pp. 83-97
    • Lin, C.K.1
  • 14
    • 59649084117 scopus 로고    scopus 로고
    • Conditional diagnosability of hypercubes under the comparison diagnosis model
    • Hsu G.-H., et al. Conditional diagnosability of hypercubes under the comparison diagnosis model. Journal of Systems Architecture 55 2 (2009) 140-146
    • (2009) Journal of Systems Architecture , vol.55 , Issue.2 , pp. 140-146
    • Hsu, G.-H.1
  • 15
    • 14844366755 scopus 로고    scopus 로고
    • Conditional diagnosability measure for large multiprocessor systems
    • Lai P.L., et al. Conditional diagnosability measure for large multiprocessor systems. IEEE Trans. Comput. 54 (2005) 165-175
    • (2005) IEEE Trans. Comput. , vol.54 , pp. 165-175
    • Lai, P.L.1
  • 16
    • 34250833453 scopus 로고
    • A group-theoretic model for symmetric interconnection networks
    • Akers S.B., and Krishnamurthy B. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38 4 (1989) 555-566
    • (1989) IEEE Trans. Comput. , vol.38 , Issue.4 , pp. 555-566
    • Akers, S.B.1    Krishnamurthy, B.2
  • 17
    • 49049087774 scopus 로고    scopus 로고
    • A class of Cayley networks based on the alternating groups
    • (in Chinese)
    • Ji Y.H. A class of Cayley networks based on the alternating groups. Adv. Math. 4 (1998) 361-362 (in Chinese)
    • (1998) Adv. Math. , vol.4 , pp. 361-362
    • Ji, Y.H.1
  • 18
    • 84954515651 scopus 로고
    • A new class of interconnection networks based on the alternating groups
    • Jwo J.S., Lakshmivarahan S., and Dhall S.K. A new class of interconnection networks based on the alternating groups. Networks 23 (1993) 315-326
    • (1993) Networks , vol.23 , pp. 315-326
    • Jwo, J.S.1    Lakshmivarahan, S.2    Dhall, S.K.3
  • 19
    • 25844443241 scopus 로고    scopus 로고
    • On the maximal connected component of hypercube with faulty vertices
    • Yang X.F., Evans D.J., Chen B., Megson G.M., and Lai H.-J. On the maximal connected component of hypercube with faulty vertices. Int. J. Comput. Math. 81 5 (2004) 515-525
    • (2004) Int. J. Comput. Math. , vol.81 , Issue.5 , pp. 515-525
    • Yang, X.F.1    Evans, D.J.2    Chen, B.3    Megson, G.M.4    Lai, H.-J.5
  • 20
    • 54049090846 scopus 로고    scopus 로고
    • Largest connected component of a star graph with faulty vertices
    • Yang X.F., Megson G.M., Tang Y.Y., and Xing Y.K. Largest connected component of a star graph with faulty vertices. Int. J. Comput. Math. 85 12 (2008) 1771-1778
    • (2008) Int. J. Comput. Math. , vol.85 , Issue.12 , pp. 1771-1778
    • Yang, X.F.1    Megson, G.M.2    Tang, Y.Y.3    Xing, Y.K.4
  • 21
    • 0141764683 scopus 로고    scopus 로고
    • Increasing the connectivity of the star graphs
    • Cheng E., and Lipman M.J. Increasing the connectivity of the star graphs. Networks 40 3 (2002) 165-169
    • (2002) Networks , vol.40 , Issue.3 , pp. 165-169
    • Cheng, E.1    Lipman, M.J.2
  • 22
    • 34548223037 scopus 로고    scopus 로고
    • Linearly many faults in Cayley graphs generated by transposition trees
    • Cheng E., and Lipták L. Linearly many faults in Cayley graphs generated by transposition trees. Inform. Sci. 177 (2007) 4877-4882
    • (2007) Inform. Sci. , vol.177 , pp. 4877-4882
    • Cheng, E.1    Lipták, L.2
  • 23
    • 0003244908 scopus 로고
    • Permutation Groups and Combinatorial Structures
    • Cambridge University Press, Cambridge
    • Biggs N.L., and White A.T. Permutation Groups and Combinatorial Structures. London Mathematical Society Lecture Notes vol. 33 (1979), Cambridge University Press, Cambridge
    • (1979) London Mathematical Society Lecture Notes , vol.33
    • Biggs, N.L.1    White, A.T.2
  • 24
    • 33947203103 scopus 로고    scopus 로고
    • Internode distance and optimal routing in a class of alternating group networks
    • Chen B.X., Xiao W.J., and Parhami B. Internode distance and optimal routing in a class of alternating group networks. IEEE Trans. Comput. 12 (2006) 1645-1648
    • (2006) IEEE Trans. Comput. , vol.12 , pp. 1645-1648
    • Chen, B.X.1    Xiao, W.J.2    Parhami, B.3
  • 25
    • 78149471113 scopus 로고    scopus 로고
    • Construction of vertex-disjoint paths in alternating group networks
    • in press, doi:10.1007/s11227-009-0304-7
    • S. Zhou, W.J. Xiao, B. Parhami, Construction of vertex-disjoint paths in alternating group networks, J. Supercomputing, in press, doi:10.1007/s11227-009-0304-7
    • J. Supercomputing
    • Zhou, S.1    Xiao, W.J.2    Parhami, B.3
  • 27
    • 0024765312 scopus 로고
    • Generalized measures of fault tolerance with application to N-cube networks
    • Esfahanian A.H. Generalized measures of fault tolerance with application to N-cube networks. IEEE Trans. Comput. 38 (1989) 1586-1591
    • (1989) IEEE Trans. Comput. , vol.38 , pp. 1586-1591
    • Esfahanian, A.H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.