Skip to main content
SpringerLink
Log in

A fast sorting algorithm for VLSI

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1983)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 154))

Included in the following conference series:

Abstract

An algorithm for sorting n elements in O(√n) steps is presented. Its simple structure and the fact that it needs local communication only make it suitable for an implementation by means of VLSI technology.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Batcher, K.E.: Sorting networks and their application. Proc. AFIPS 1968 SJCC, Vol. 32, AFIPS Press, Montvale, N.J., 307–314 (1968)

    Google Scholar 

  2. Chazelle, B., Monier, L.: A model of computation for VLSI with related complexity results. Proc. 13th STOC, 318–325 (1981)

    Google Scholar 

  3. Foster, M.J., Kung, H.T.: The design of special-purpose VLSI chips. IEEE Computer, 26–40 (1980)

    Google Scholar 

  4. Knuth, D.E.: The Art of Computer Programming Vol. 3: Sorting and Searching. Addison Wesley (1973)

    Google Scholar 

  5. Kung, H.T., Thompson, C.D.: Sorting on a mesh-connected parallel computer. Comm. ACM 20, 263–271 (1977)

    Google Scholar 

  6. Mead, C., Conway, L.: Introduction to VLSI Systems. Addison Wesley (1980)

    Google Scholar 

  7. Stone, H.S.: Parallel processing with the perfect shuffle. IEEE Trans. Comput. C-20, 153–161 (1971)

    Google Scholar 

  8. Thompson, C.D.: A complexity theory for VLSI. Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh (1980)

    Google Scholar 

  9. van Leeuwen, J.: Distributed computing. Technical report RUU-CS-82-8, Department of Computer Science, University of Utrecht (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, D-2300, Kiel

    Hans -Werner Lang, Manfred Schimmler, Hartmut Schmeck & Heiko Schröder

Authors
  1. Hans -Werner Lang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred Schimmler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hartmut Schmeck
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Heiko Schröder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lang, H.W., Schimmler, M., Schmeck, H., Schröder, H. (1983). A fast sorting algorithm for VLSI. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036925

Download citation

  • DOI: https://doi.org/10.1007/BFb0036925

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12317-0

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation