• DocumentCode
    2695916
  • Title

    Efficient scalable mesh algorithms for merging, sorting and selection

  • Author

    Ramnath, Sarnath

  • Author_Institution
    Dept. of Comput. Sci., St. Cloud State Univ., MN, USA
  • fYear
    1995
  • fDate
    15-17 Mar 1995
  • Firstpage
    280
  • Lastpage
    286
  • Abstract
    Efficient scalable algorithms are developed for a mesh with fixed buses. The problems considered are merging, sorting and selection. The size of the input is fixed at n, and the mesh size is varied from √n×√n to n×n. The merging algorithm is optimal for all the mesh sizes, whereas the sorting and selection algorithms are within factors of i/(1-ε) and log4/3 n respectively, of the optimal
  • Keywords
    merging; parallel algorithms; parallel machines; sorting; field buses; merging; merging algorithm; mesh connected computers; scalable mesh algorithms; selection algorithms; sorting; Broadcasting; Clouds; Computer architecture; Computer science; Concurrent computing; Context modeling; Merging; Parallel algorithms; Routing; Sorting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on
  • Conference_Location
    Fukushima
  • Print_ISBN
    0-8186-7038-X
  • Type

    conf

  • DOI
    10.1109/AISPAS.1995.401328
  • Filename
    401328
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2695916