• DocumentCode
    1084933
  • Title

    Sorting n2 numbers on n×n meshes

  • Author

    Nigam, Madhusudan ; Sahni, Sartaj

  • Author_Institution
    Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA
  • Volume
    6
  • Issue
    12
  • fYear
    1995
  • fDate
    12/1/1995 12:00:00 AM
  • Firstpage
    1221
  • Lastpage
    1225
  • Abstract
    We show that by folding data from an n×n mesh onto an n×(n/k) submesh, sorting on the submesh, and finally unfolding back onto the entire n×n mesh it is possible to sort on bidirectional and strict unidirectional meshes using a number of routing steps that is very close to the distance lower bound for these architectures
  • Keywords
    computational complexity; parallel algorithms; sorting; bidirectional meshes; data folding; data unfolding; distance lower bound; mesh architectures; routing steps; submesh; unidirectional meshes; Computer architecture; Concurrent computing; Distributed computing; Notice of Violation; Routing; Sorting;
  • fLanguage
    English
  • Journal_Title
    Parallel and Distributed Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9219
  • Type

    jour

  • DOI
    10.1109/71.476164
  • Filename
    476164
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1084933