• DocumentCode
    1138431
  • Title

    Systolic s2-way merge sort is optimal

  • Author

    Schmeck, Hartmut ; Schröder, Heiko ; Starke, Christoph

  • Author_Institution
    Inst. fur Inf. & Praktische Math., Kiel Univ., West Germany
  • Volume
    38
  • Issue
    7
  • fYear
    1989
  • fDate
    7/1/1989 12:00:00 AM
  • Firstpage
    1052
  • Lastpage
    1056
  • Abstract
    The time complexity of Thompson and Kung´s (1977) s2 -way merge sort is analyzed and shown to be asymptotically optimal with respect to the recently improved lower bound on sorting on a mesh-connected n×n array. New lower bounds for systolic sorting are derived. A systolic version of s2 -way merge sort is systematically constructed and shown to be asymptotically optimal as well
  • Keywords
    parallel algorithms; sorting; asymptotically optimal; lower bound; s2-way merge sort; systolic version; time complexity; Arithmetic; Art; Computational modeling; Libraries; Programming; Registers; Sorting;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.30857
  • Filename
    30857
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1138431