• DocumentCode
    1831485
  • Title

    Deterministic permutation routing on a reconfigurable mesh

  • Author

    Kapoor, Ashish ; Schröder, Heiko ; Beresford-Smith, B.

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Newcastle Univ., NSW, Australia
  • fYear
    1994
  • fDate
    26-29 Apr 1994
  • Firstpage
    536
  • Lastpage
    540
  • Abstract
    Presents an algorithm for Permutation Routing on a reconfigurable mesh based on the divide and conquer paradigm. The algorithm has a worst case running time of 4n+O(log2n) communication steps and requires a maximum queue size of 5. The O(log2 n) term is associated with communication of single words which convey information about the distribution of packets. Hence, if the packet length is much larger than a single word, then the constant associated with this term is negligible
  • Keywords
    multiprocessor interconnection networks; network routing; packet switching; parallel architectures; deterministic permutation routing; distribution of packets; divide and conquer; packet length; permutation routing; reconfigurable mesh; worst case running time; Australia; Delay; Distributed computing; Parallel machines; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1994. Proceedings., Eighth International
  • Conference_Location
    Cancun
  • Print_ISBN
    0-8186-5602-6
  • Type

    conf

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