I/O overlapped sorting schemes for VLSI
Hyunchul Shin, Alyssa Welch, Miroslaw Malek · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1983
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.