• DocumentCode
    301133
  • Title

    Algorithms for sorting arbitrary input using a fixed-size parallel sorting device

  • Author

    Zheng, S.Q.

  • Author_Institution
    Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
  • Volume
    2
  • fYear
    1996
  • fDate
    12-16 Aug 1996
  • Firstpage
    95
  • Abstract
    A simple computing model for sorting an arbitrary number of elements using a fixed-size sorting device is proposed, and a framework for designing a class of parallel sorting algorithms under this model is presented
  • Keywords
    computational complexity; parallel algorithms; sorting; arbitrary input sorting algorithms; computing model; fixed-size parallel sorting device; parallel sorting algorithms; Algorithm design and analysis; Circuits; Computer networks; Computer science; Concurrent computing; Coprocessors; Costs; Joining processes; Sorting; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on
  • Conference_Location
    Ithaca, NY
  • ISSN
    0190-3918
  • Print_ISBN
    0-8186-7623-X
  • Type

    conf

  • DOI
    10.1109/ICPP.1996.537387
  • Filename
    537387
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=301133