• DocumentCode
    2784265
  • Title

    Adaptive routing algorithms and implementation for interconnection network TESH for parallel processing

  • Author

    Miura, Yasuyuki ; Kaneko, Masahiro ; Watanabe, Shigeyoshi

  • Author_Institution
    Shonan Inst. of Technol., Fujisawa, Japan
  • fYear
    2010
  • fDate
    10-14 Oct. 2010
  • Firstpage
    308
  • Lastpage
    311
  • Abstract
    We introduce three adaptive routing algorithms for the hierarchical interconnection network TESH (tori-connected meshes) and evaluate their hardware costs and delays. TESH, which consists of a hierarchical torus interconnection between meshes as a basic module, is one of the k-ary n-cube networks, for which many adaptive routing algorithms have already been proposed. Adaptive routings for TESH have also been proposed in previous work.
  • Keywords
    hypercube networks; network routing; parallel processing; TESH; adaptive routing algorithm; hierarchical torus interconnection network; k-ary n-cube network; parallel processing; tori-connected meshes; Clocks; Delay; Hardware; Heuristic algorithms; Multiprocessor interconnection; Routing; System recovery;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Local Computer Networks (LCN), 2010 IEEE 35th Conference on
  • Conference_Location
    Denver, CO
  • ISSN
    0742-1303
  • Print_ISBN
    978-1-4244-8387-7
  • Type

    conf

  • DOI
    10.1109/LCN.2010.5735729
  • Filename
    5735729
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2784265