• DocumentCode
    1149642
  • Title

    External Sorting in VLSI

  • Author

    Bonuccelli, M.A. ; Lodi, E. ; Pagli, L.

  • Author_Institution
    Dipartimento di Informatica, Universita di Pisa
  • Issue
    10
  • fYear
    1984
  • Firstpage
    931
  • Lastpage
    934
  • Abstract
    The problem of sorting n elements using VLSI chips that can sort only q(q < n) elements at a time is considered. The proposed VLSI chip consists of a mesh of trees. Two classical algorithms, i.e., merge sort and bitonic sort, are modified to efficiently solve the external sorting problem using this chip.
  • Keywords
    Bitonic sort; VLSI; external sorting; merge sort; mesh of trees; time complexity; Appropriate technology; Binary trees; Concurrent computing; Registers; Sorting; Very large scale integration; Bitonic sort; VLSI; external sorting; merge sort; mesh of trees; time complexity;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1984.1676356
  • Filename
    1676356
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1149642