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].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.E. Batcher, “Sorting Networks and their Applications,” AFIPS Conference Proc., Vol.32, 1968, Spring Joint Computer Conference, pp. 307–314, Apr. 1968.
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.
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.
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.
D.S. Hirschberg, “Fast Parallel Sorting Algorithms,” Communications of the ACM, Vol. 21, No. 8, pp. 657–661, Aug. 1978.
D.E. Knuth, “The Art of Computer Programming,” Vol. 3, ‘Sorting and Searching’, Reading, Massachusetts, Addison-Wesley, 1973.
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.
C.E. Leiserson, “Area-effficicent graph layouts (for VLSI),” Proc. 21st Annual Sym. on Foundations of Computer Science, IEEE, Oct. 13–15, 1980.
H. Lorin, “Sorting and Sort System,” Reading, Massachusetts, Addison-Wesley, 1975.
C. Mead and L. Conway, “Introduction to VLSI Systems,” Reading, Massachusetts, Addison-Wesley, 1980.
A. Mukhopadhyay, “Hardware Algorithms for Nonnumeric Computation,” IEEE Trans. Comput., Vol. C-28, No. 6, pp. 384–394, June 1979.
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.
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.
F.P. Preparata, “New Parallel-Sorting Schemes,” IEEE Trans. Comput. Vol. C-27, No. 7, pp. 669–673, July 1978.
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.
C.D. Thompson and H.T. Kung, “Sorting on a Mesh-Connected Parallel Computer,” Communications of the ACM, Vol. 20, No. 4, April 1977.
H. Yasuura, N. Takagi, and S. Najima, “The Parallel Enumeration Sorting Scheme for VLSI,” IEEE Trans. Comput. (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Wien
About this chapter
Cite this chapter
Wong, C.K. (1984). A VLSI Sorter. In: Ausiello, G., Lucertini, M., Serafini, P. (eds) Algorithm Design for Computer System Design. International Centre for Mechanical Sciences, vol 284. Springer, Vienna. https://doi.org/10.1007/978-3-7091-4338-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-7091-4338-4_8
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81816-9
Online ISBN: 978-3-7091-4338-4
eBook Packages: Springer Book Archive