• DocumentCode
    2035356
  • Title

    On the Bit-Level Complexity of Bitonic Sorting Networks

  • Author

    Al-Hajery, Majed Z. ; Batcher, Kenneth E.

  • Author_Institution
    Kent State University, USA
  • Volume
    3
  • fYear
    1993
  • fDate
    16-20 Aug. 1993
  • Firstpage
    209
  • Lastpage
    214
  • Abstract
    Bitonic sorting networks can be implemented with a bit-level cost complexity of O(N log^2 N) using comparators with bit-level O(1) time and cost complexities. Items to be sorted are pipelined (worm-hole routed) bit-serially most-significant-bit first through the network. The cost complexity can be reduced to O(N log N) by recirculating items of length O(logN) through logN stages.
  • Keywords
    Computer science; Costs; Mathematics; Network topology; Parallel processing; Sorting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 1993. ICPP 1993. International Conference on
  • Conference_Location
    Syracuse, NY, USA
  • ISSN
    0190-3918
  • Print_ISBN
    0-8493-8983-6
  • Type

    conf

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