I/O overlapped sorting schemes for VLSI
Conference
·
OSTI ID:5198185
A class of sorting schemes for VLSI are surveyed in which the sorting time completely overlaps input/output time. The I/O overlapped sorting schemes considered most attractive for online real-time sorting include the ripple sorter, rebound sorter, and parallel enumeration sorter. Comparison analysis demonstrates that the ripple sorter based on a linear systolic array is the most efficient for sorting and the most suitable for VLSI implementation. A hardware algorithm is presented for the ripple sorter. 7 references.
- OSTI ID:
- 5198185
- Country of Publication:
- United States
- Language:
- English
Similar Records
The analysis and synthesis of a parallel sorting engine
Parallel enumeration sorting scheme for VLSI
Zero-time VLSI sorter
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6093165
Parallel enumeration sorting scheme for VLSI
Journal Article
·
Tue Nov 30 23:00:00 EST 1982
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6153406
Zero-time VLSI sorter
Journal Article
·
Mon Feb 28 23:00:00 EST 1983
· IBM J. Res. Dev.; (United States)
·
OSTI ID:5304057