• DocumentCode
    3315540
  • Title

    Path embedding in faulty locally twisted cubes

  • Author

    Han, Yuejuan ; Fan, Jianxi ; Yang, Jiwen ; Qian, Peide

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Soochow Univ., Suzhou, China
  • fYear
    2009
  • fDate
    8-11 Aug. 2009
  • Firstpage
    214
  • Lastpage
    218
  • Abstract
    As a newly introduced interconnection network for parallel computing, the locally twisted cube possesses many desirable properties. In this paper, fault-tolerant embedding of paths in locally twisted cubes is studied. Let LTQn(V,E) denotes the n-dimensional locally twisted cube. We find that, for any faulty set F sub V (LTQn)cupE(LTQn) with |F| les n - 3 and lscr with 2n-1 -1 les lscr les |V (LTQn -F)| - 1 for any integer n ges 3, a path of length lscr can be embedded between any two distinct nodes with dilation 1 in LTQn-F. And, the result does not hold if lscr les 2n-1-2 or |F| ges n - 2, that is, the two bounds are tight. Moreover, this result extends the known result on (n-3)-Hamiltonian connectivity of LTQn in the literature.
  • Keywords
    fault tolerance; multiprocessor interconnection networks; network theory (graphs); parallel processing; set theory; Hamiltonian connectivity; fault-tolerant path embedding; faulty locally twisted cube; faulty set; interconnection network; parallel computing; Computer science; Delay; Distributed computing; Fault tolerance; Fault tolerant systems; Hypercubes; Multiprocessor interconnection networks; Parallel algorithms; Parallel processing; dilation; embedding; fault-tolerant; locally twisted cube; parallel computing system; path;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-4519-6
  • Electronic_ISBN
    978-1-4244-4520-2
  • Type

    conf

  • DOI
    10.1109/ICCSIT.2009.5234748
  • Filename
    5234748