메뉴 건너뛰기




Volumn 177, Issue 19, 2007, Pages 4200-4207

Node-disjoint paths in hierarchical hypercube networks

Author keywords

Container; Hierarchical hypercube network; Hypercube; Interconnection network; Node disjoint paths

Indexed keywords

HIERARCHICAL HYPERCUBE NETWORKS; HYPERCUBE; NODE-DISJOINT PATHS;

EID: 34447345131     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.02.035     Document Type: Article
Times cited : (58)

References (26)
  • 4
    • 0040745580 scopus 로고    scopus 로고
    • On the Rabin number problem
    • Duh D.R., and Chen G.H. On the Rabin number problem. Networks 30 3 (1997) 219-230
    • (1997) Networks , vol.30 , Issue.3 , pp. 219-230
    • Duh, D.R.1    Chen, G.H.2
  • 5
    • 10444265226 scopus 로고    scopus 로고
    • Node-pancyclicity and edge-pancyclicity of crossed cubes
    • Fan J., Lin X., and Jia X. Node-pancyclicity and edge-pancyclicity of crossed cubes. Information Processing Letters 93 3 (2005) 133-138
    • (2005) Information Processing Letters , vol.93 , Issue.3 , pp. 133-138
    • Fan, J.1    Lin, X.2    Jia, X.3
  • 6
    • 0141541617 scopus 로고    scopus 로고
    • Node-disjoint paths and related problems on hierarchical cubic networks
    • Fu J.S., Chen G.H., and Duh D.R. Node-disjoint paths and related problems on hierarchical cubic networks. Networks 40 3 (2002) 142-154
    • (2002) Networks , vol.40 , Issue.3 , pp. 142-154
    • Fu, J.S.1    Chen, G.H.2    Duh, D.R.3
  • 7
    • 25844441031 scopus 로고    scopus 로고
    • Hamiltonicity of the WK-recursive network with and without faulty nodes
    • Fu J.S. Hamiltonicity of the WK-recursive network with and without faulty nodes. IEEE Transactions on Parallel and Distributed Systems 16 9 (2005) 853-865
    • (2005) IEEE Transactions on Parallel and Distributed Systems , vol.16 , Issue.9 , pp. 853-865
    • Fu, J.S.1
  • 8
    • 31044435457 scopus 로고    scopus 로고
    • Longest fault-free paths in hypercubes with vertex faults
    • Fu J.S. Longest fault-free paths in hypercubes with vertex faults. Information Sciences 176 7 (2006) 759-771
    • (2006) Information Sciences , vol.176 , Issue.7 , pp. 759-771
    • Fu, J.S.1
  • 9
    • 0001295502 scopus 로고    scopus 로고
    • An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
    • Gu Q.P., and Peng S.T. An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes. Journal of Parallel Distributed Computing 60 6 (2000) 764-774
    • (2000) Journal of Parallel Distributed Computing , vol.60 , Issue.6 , pp. 764-774
    • Gu, Q.P.1    Peng, S.T.2
  • 13
    • 27744561507 scopus 로고    scopus 로고
    • Wide diameter and minimum length of disjoint menger path systems
    • Kojima T. Wide diameter and minimum length of disjoint menger path systems. Networks 46 3 (2005) 136-141
    • (2005) Networks , vol.46 , Issue.3 , pp. 136-141
    • Kojima, T.1
  • 14
    • 23844513092 scopus 로고    scopus 로고
    • Strong Rabin numbers of folded hypercubes
    • Lai C.N., and Chen G.H. Strong Rabin numbers of folded hypercubes. Theoretical Computer Science 341 1-3 (2005) 196-215
    • (2005) Theoretical Computer Science , vol.341 , Issue.1-3 , pp. 196-215
    • Lai, C.N.1    Chen, G.H.2
  • 15
    • 34447302507 scopus 로고
    • Interconnecting computers: architecture technology and economics
    • Programming Languages and System Architectures. Gutknecht J. (Ed), Springer
    • Lampson B.W. Interconnecting computers: architecture technology and economics. In: Gutknecht J. (Ed). Programming Languages and System Architectures. Lecture Notes in Computer Science vol. 782 (1994), Springer 1-20
    • (1994) Lecture Notes in Computer Science , vol.782 , pp. 1-20
    • Lampson, B.W.1
  • 17
    • 0022141776 scopus 로고
    • Fat-trees: universal networks for hardware-efficient supercomputing
    • Leiserson C.E. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers 34 10 (1985) 892-901
    • (1985) IEEE Transactions on Computers , vol.34 , Issue.10 , pp. 892-901
    • Leiserson, C.E.1
  • 18
    • 4243117337 scopus 로고    scopus 로고
    • Hyper hamiltonian laceability on edge fault star graph
    • Li T.K., Tan J.J.M., and Hsu L.H. Hyper hamiltonian laceability on edge fault star graph. Information Sciences 165 1-2 (2004) 59-71
    • (2004) Information Sciences , vol.165 , Issue.1-2 , pp. 59-71
    • Li, T.K.1    Tan, J.J.M.2    Hsu, L.H.3
  • 19
    • 84904335150 scopus 로고    scopus 로고
    • Q.M. Malluhi, M.A. Bayoumi, T.R.N. Rao, On the hierarchical hypercube interconnection network, in: Proceedings of the International Parallel Processing Symposium, 1993, pp. 524-530.
  • 20
    • 0028319351 scopus 로고
    • The hierarchical hypercube: a new interconnection topology for massively parallel systems
    • Malluhi Q.M., and Bayoumi M.A. The hierarchical hypercube: a new interconnection topology for massively parallel systems. IEEE Transactions on Parallel and Distributed Systems 5 1 (1994) 17-30
    • (1994) IEEE Transactions on Parallel and Distributed Systems , vol.5 , Issue.1 , pp. 17-30
    • Malluhi, Q.M.1    Bayoumi, M.A.2
  • 21
    • 0026981690 scopus 로고    scopus 로고
    • Q.M. Malluhi, M.A. Bayoumi, Properties and performance of the hierarchical hypercube, in: Proceedings of the International Parallel Processing Symposium, 1992, pp. 47-50.
  • 22
    • 0019563297 scopus 로고
    • The cube-connected cycles: a versatile network for parallel computation
    • Preparata F.P., and Vuillemin J. The cube-connected cycles: a versatile network for parallel computation. Communications of the ACM 24 5 (1981) 300-309
    • (1981) Communications of the ACM , vol.24 , Issue.5 , pp. 300-309
    • Preparata, F.P.1    Vuillemin, J.2
  • 23
    • 0024641589 scopus 로고
    • Efficient dispersal of information for security, load balancing, and fault tolerance
    • Rabin M.O. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of ACM 36 2 (1989) 335-348
    • (1989) Journal of ACM , vol.36 , Issue.2 , pp. 335-348
    • Rabin, M.O.1
  • 26
    • 29744471159 scopus 로고    scopus 로고
    • On embedding cycles into faulty twisted cubes
    • Yang M.C., Li T.K., Tan J.J.M., and Hsu L.H. On embedding cycles into faulty twisted cubes. Information Sciences 176 6 (2006) 676-690
    • (2006) Information Sciences , vol.176 , Issue.6 , pp. 676-690
    • Yang, M.C.1    Li, T.K.2    Tan, J.J.M.3    Hsu, L.H.4


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