Advertisement

On optimal parallelization of sorting networks

  • Ethan Gannett
  • Suraj C. Kothari
  • Hsu-Chun Yen
Session 4 Parallel Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)

Keywords

Execution Time Parallel Execution Sequential Execution Sequential Trace Comparator Module 
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]
    R.S. Boyer and J.S. Moore, A Computational Logic, Academic Press, 1979.Google Scholar
  2. [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.CrossRefGoogle Scholar
  3. [3]
    D.E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, MA,(1973).Google Scholar
  4. [4]
    C. Lengauer, A methodology for programming with concurrency: The formalism, Sci. of Comput. Programm., 2, (1), (1982), pp. 19–52.CrossRefGoogle Scholar
  5. [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.CrossRefGoogle Scholar
  6. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Ethan Gannett
    • 1
  • Suraj C. Kothari
    • 1
  • Hsu-Chun Yen
    • 1
  1. 1.Department of Computer ScienceIowa State UniversityAmesUSA

Personalised recommendations