• DocumentCode
    309160
  • Title

    Optimal wormhole routing in the (n,d)-torus

  • Author

    Bock, Stefan ; Der Heide, Friedhelm Meyer auf ; Scheideler, Christian

  • Author_Institution
    Dept. of Econ., Paderborn Univ., Germany
  • fYear
    1997
  • fDate
    1-5 Apr 1997
  • Firstpage
    326
  • Lastpage
    332
  • Abstract
    The authors consider wormhole routing in a d-dimensional torus of side length n. In particular they present an optimal randomized algorithm for routing worms of length up to O(n/(d log n)2), one per node, to random destinations. Previous algorithms only work optimally for two dimensions, or are a factor of log n away from the optimal running time. As a by-product they develop an algorithm for the 2-dimensional torus that guarantees an optimal runtime for worms of length up to O(n/(log n)2) with much higher probability than all previous algorithms
  • Keywords
    computational complexity; multiprocessing systems; network routing; parallel algorithms; probability; randomised algorithms; (n,d)-torus; 2D torus; d-dimensional torus; optimal randomized algorithm; optimal running time; optimal runtime; optimal wormhole routing; probability; random destinations; Computer science; Computer worms; Concurrent computing; Delay; Magnetic heads; Mathematics; Optical switches; Parallel algorithms; Routing protocols; Runtime;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1997. Proceedings., 11th International
  • Conference_Location
    Genva
  • ISSN
    1063-7133
  • Print_ISBN
    0-8186-7793-7
  • Type

    conf

  • DOI
    10.1109/IPPS.1997.580921
  • Filename
    580921
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=309160