Abstract
A new class of sorting algorithms called partition sorts is presented. Partition sorts can be viewed as periodic 2d-primitive sorting networks. Periodic says that they are concatenations of identical comparator networks. 2d-primitive says that there is a planar layout for these algorithms such that communication is exclusively local. This makes its members specially suitable for an implementation by means of VLSI-technology.
It is shown that partition sorts sort in less than n steps. Simulation results for a special partition sort algorithm indicate that its worst case behaviour is Ω (n) but a significant factor faster than odd-even transposition sort. In the average it seems to run in \( {\text{O(}}\sqrt {\text{n}} {\text{)}}\) . The regular and modular layout for a systolic implementation of this partition sort algorithm is presented.
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.
Literature
Bilardi, G., Pracchi, M., Preparata, F.P.: A Critique and an Appraisal of VLSI Models of Computation. In: Kung, H.T., Sproull, B., Steele, G. (eds.): VLSI Systems and Computations, Springer Verlag, 81–88 (1981)
Chazelle, B.M., Monier, L.M.: A Model of Computation for VLSI with Related Complexity Results. Proc. 13th Symp. Theory of Computing, 318–325 (1981)
Chazelle, B.M., Monier, L.M.: Optimality in VLSI. In: Gray, J.P. (ed.): VLSI 81, Academic Press, London, 269–278 (1981)
Knuth, D.E.: The Art of Computer Programming. Vol 3/ Sorting and Searching. Addison-Wesley, Reading, MA 1973
Kung, H.T., Leiserson, C.E.: Algorithms for VLSI processor arrays. In chapter 8 of [MC]
Kung, H.T., Thompson, C.D.: Sorting on a Mesh-Connected Parallel Computer. CACM, Vol. 20, 263–271 (1977)
LSSS]Lang, H.W., Schimmler, M., Schmeck, H., Schröder, H.: A Fast Sorting Algorithm for VLSI. Proc. 10th ICALP, 1983.
Mead, C., Conway, L.: Introduction to VLSI Systems. Addison-Wesley, Reading, MA 1980
Schmeck, H., Schröder, H.: VLSI-gerechte Lexikon-Rechner. Tech. Report 8204, Inst. für Informatik, Universität Kiel, Kiel, 1982
Thompson, C.D.: Area-Time Complexity for VLSI. Proc. 11th Symp. Theory of Computing 81–88 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schröder, H. (1983). Partition Sorts for VLSI. In: Kupka, I. (eds) GI - 13. Jahrestagung. Informatik-Fachberichte, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69298-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-69298-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12734-5
Online ISBN: 978-3-642-69298-7
eBook Packages: Springer Book Archive