A recognizer and post-recognizer for optimizing execution times of programs

  • P. F. Reynolds
  • K. M. Chandy
Session 5: Scheduling II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 24)


  1. [1]
    A.J. Bernstein, "Analysis of Programs for Parallel Processing", IEEE Trans. on EC (October, 1966), pp. 12–34.Google Scholar
  2. [2]
    E.F. Coffman, and P.J. Denning, Operating Systems Theory, Prentice-Hall, (1973)Google Scholar
  3. [3]
    C.V. Ramamoorthy, and M.J. Gonzalez, "A Survey of Techniques for Recognizing Parallel Processable Streams in Computer Programs," Proc. AFIPS Fall Joint Computer Conf. (1969), pp. 1–15.Google Scholar
  4. [4]
    C.V. Ramamoorthy, and M.J. Gonzalez, "Parallel Task Execution in a Decentralized System," IEEE Trans. on Computers, (December, 1972), pp. 1310–1322.Google Scholar
  5. [5]
    G.S. Tjaden, and M.J. Flynn, "Representation of Concurrency with Ordering Matrices", IEEE Trans. on Computers, (August, 1973), pp. 752–761.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • P. F. Reynolds
    • 1
  • K. M. Chandy
    • 1
  1. 1.Department of Computer SciencesThe University of Texas at AustinAustin

Personalised recommendations