Advertisement

A VLSI Sorter

  • C. K. Wong
Part of the International Centre for Mechanical Sciences book series (CISM, volume 284)

Abstract

Sorting is one of the most important operations in data processing. It is estimated that in data processing centers, over 25 percent of CPU time is devoted to sorting [6]. Many sequential and parallel sorting algorithms have been proposed and studied [1–3, 5, 6, 8, 10, 13–18]. Implementation of various sorting algorithms in different hardware structures has also been investigated [2–4, 7, 8, 11, 12, 16, 18].

Keywords

Transfer Action Input Stage Small Item Clock Phase Sorting Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K.E. Batcher, “Sorting Networks and their Applications,” AFIPS Conference Proc., Vol.32, 1968, Spring Joint Computer Conference, pp. 307–314, Apr. 1968.Google Scholar
  2. [2]
    T.C. Chen, V.Y. Lum, and C. Tung, “The Rebound Sorter: An Efficient Sort Engine for Large Files,” Proc. 4th VLDB, pp. 312–318, Sept. 1978.Google Scholar
  3. [3]
    K. Chung, F. Luccio, and C.K. Wong, “On the Complexity of Sorting in Magnetic Bubble Memory Systems,” IEEE Trans. Comput., Vol. C-29, No. 7, pp. 553–563, July 1980.CrossRefMathSciNetGoogle Scholar
  4. [4]
    M.J. Foster and H.T. Kung, “The Design of Special-Purpose VLSI Chips,” IEEE Computer, Vol. 13, No. 1, pp. 26–40, Jan. 1980.CrossRefGoogle Scholar
  5. [5]
    D.S. Hirschberg, “Fast Parallel Sorting Algorithms,” Communications of the ACM, Vol. 21, No. 8, pp. 657–661, Aug. 1978.CrossRefMATHMathSciNetGoogle Scholar
  6. [6]
    D.E. Knuth, “The Art of Computer Programming,” Vol. 3, ‘Sorting and Searching’, Reading, Massachusetts, Addison-Wesley, 1973.Google Scholar
  7. [7]
    D.T. Lee, H. Chang, and C.K. Wong, “An On-Chip Compare/Steer Bubble Sorter,” IEEE Trans. Comput., Vol. C-30, No. 6, pp. 396–405, June 1981.CrossRefMathSciNetGoogle Scholar
  8. [8]
    C.E. Leiserson, “Area-effficicent graph layouts (for VLSI),” Proc. 21st Annual Sym. on Foundations of Computer Science, IEEE, Oct. 13–15, 1980.Google Scholar
  9. [9]
    H. Lorin, “Sorting and Sort System,” Reading, Massachusetts, Addison-Wesley, 1975.Google Scholar
  10. [10]
    C. Mead and L. Conway, “Introduction to VLSI Systems,” Reading, Massachusetts, Addison-Wesley, 1980.Google Scholar
  11. [11]
    A. Mukhopadhyay, “Hardware Algorithms for Nonnumeric Computation,” IEEE Trans. Comput., Vol. C-28, No. 6, pp. 384–394, June 1979.CrossRefGoogle Scholar
  12. [12]
    D.E. Muller and F.P. Preparata, “Bounds to Complexities of Networks for Sorting and for Switching,” JACM, Vol. 22, No. 2, pp. 195–201, Apr. 1975.CrossRefMATHMathSciNetGoogle Scholar
  13. [13]
    D. Nassimi and S. Sahni, “Bitonic Sort on a Mesh-Connected Parallel Computer,” IEEE Trans. Comput., Vol. C-28, No. 1, pp. 2–7, January 1979.CrossRefGoogle Scholar
  14. [14]
    F.P. Preparata, “New Parallel-Sorting Schemes,” IEEE Trans. Comput. Vol. C-27, No. 7, pp. 669–673, July 1978.CrossRefMathSciNetGoogle Scholar
  15. [15]
    Y. Tanaka, Y. Nozaka, and A. Masuyama, “Pipelined Searching and Sorting Modules as Components of a Data Flow Database Computer,” Proc. IFIP ‘80, pp. 427–432, October 1980.Google Scholar
  16. [16]
    C.D. Thompson and H.T. Kung, “Sorting on a Mesh-Connected Parallel Computer,” Communications of the ACM, Vol. 20, No. 4, April 1977.Google Scholar
  17. [17]
    H. Yasuura, N. Takagi, and S. Najima, “The Parallel Enumeration Sorting Scheme for VLSI,” IEEE Trans. Comput. (to appear).Google Scholar

Copyright information

© Springer-Verlag Wien 1984

Authors and Affiliations

  • C. K. Wong
    • 1
  1. 1.IBM Thomas J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations