Skip to main content
SpringerLink
Log in

On optimal parallelization of sorting networks

  • Session 4 Parallel Algorithms
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1987)

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

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. R.S. Boyer and J.S. Moore, A Computational Logic, Academic Press, 1979.

    Google Scholar 

  2. C.-H. Huang and C. Lengauer, The automated proof of a trace transformation for a bitonic sort, Theoretical Computer Science, 46, (1986), pp. 261–284.

    Article  Google Scholar 

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

    Google Scholar 

  4. C. Lengauer, A methodology for programming with concurrency: The formalism, Sci. of Comput. Programm., 2, (1), (1982), pp. 19–52.

    Article  Google Scholar 

  5. C. Lengauer and E.C.R. Hehner, A methodology for programming with concurrency: An informal presentation, Sci. of Comput. Programm., 2, (1), (1982), pp. 1–18.

    Article  Google Scholar 

  6. C.Lengauer and C.-H. Huang, A mechanically certified theorem about optimal concurrency of sorting networks, Proc. 13th Ann. ACM Symp. on Principles of Programming Languages, (1986), pp. 307–317.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Iowa State University, 50011, Ames, Iowa, USA

    Ethan Gannett, Suraj C. Kothari & Hsu-Chun Yen

Authors
  1. Ethan Gannett
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suraj C. Kothari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hsu-Chun Yen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gannett, E., Kothari, S.C., Yen, HC. (1987). On optimal parallelization of sorting networks. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-18625-5_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48033-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation