• DocumentCode
    293687
  • Title

    On deflection worm routing on meshes

  • Author

    Roberts, Alan ; Symvonis, Antonios

  • Author_Institution
    Basser Dept. of Comput. Sci., Sydney Univ., NSW, Australia
  • Volume
    1
  • fYear
    1995
  • fDate
    19-21 Apr 1995
  • Firstpage
    375
  • Abstract
    In this paper, we consider the deflection worm routing problem on two dimensional n×n meshes. Our results include: (i) an off-line algorithm for routing permutations in O(kn) steps, and (ii) a general method to obtain deflection worm routing algorithms from packet routing algorithms
  • Keywords
    computational complexity; multiprocessor interconnection networks; O(kn) steps; deflection worm routing; packet routing algorithms; routing permutations; Computer science; Computer worms; Routing; Sorting; Tree graphs; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on
  • Conference_Location
    Brisbane, Qld.
  • Print_ISBN
    0-7803-2018-2
  • Type

    conf

  • DOI
    10.1109/ICAPP.1995.472207
  • Filename
    472207
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=293687