• DocumentCode
    2634448
  • Title

    A faster sorting algorithm in the broadcast communication model

  • Author

    Olariu, Stephan ; Schwing, James L.

  • Author_Institution
    Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA
  • fYear
    1995
  • fDate
    25-28 Apr 1995
  • Firstpage
    319
  • Lastpage
    323
  • Abstract
    We present a simple sorting algorithm for the broadcast communication model (BCM, for short). With a sequence on n items as input, our algorithm runs in O(n/plogn/ p+logk) time on a p-processor, k-channel BCM, a considerable improvement over the state of the art
  • Keywords
    parallel algorithms; sorting; broadcast communication model; faster sorting algorithm; Computer science; Frequency; Integrated circuit layout; Local area networks; Packet radio networks; Radio broadcasting; Sorting; Terminology; Time measurement; Workstations;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1995. Proceedings., 9th International
  • Conference_Location
    Santa Barbara, CA
  • Print_ISBN
    0-8186-7074-6
  • Type

    conf

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