Skip to main content
SpringerLink
Log in

Introducing parallelism into sequential programs

  • Transitionsnetze
  • Conference paper
  • First Online:
GI — 5. Jahrestagung (GI 1975)

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

Included in the following conference series:

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. Baer, J.L. / Russell, E.C.: Preparation and Evaluation of Computer Programs for Parallel Processing Streams, in L.C. Hobbs (Editor): Parallel Processor Systems, Technologies, Application, Spartan, Washington, 1970), 375–415.

    Google Scholar 

  2. Becker, H.J. / Vogel, H.: E-V-Schemata — Ein Ansatz zur formalen Behandlung paralleler Prozesse, Lecture Notes in Computer Science 26, GI-4. Jahrestagung, Springer, Berlin, 1975), 345–354.

    Google Scholar 

  3. Gonzalez, M.J. / Ramamoorthy, C.V.: Recognition and Representation of Parallel Processable Streams in Computer Programs, in L.C. Hobbs (cf./1/), 335–373.

    Google Scholar 

  4. Karp, R.M. / Miller, R.E.: Parallel Program Schemata, J. Computer and System Sciences 3,2 (May 1969), 147–195.

    Google Scholar 

  5. Keller, R.M.: Parallel Program Schemata and Maximal Parallelism, J. ACM 20 (1973), 514–537, 696–710.

    Google Scholar 

  6. Lautenbach, K.: Exakte Bedingungen der Lebendigkeit für eine Klasse von Petri-Netzen, Berichte der GMD Nr. 82, Bonn, (1973).

    Google Scholar 

  7. Linderman, J.P.: Productivity in Parallel Computation Schemata, MIT, Project MAC, Report Nr. MAC TR-111, (Dec. 1973).

    Google Scholar 

  8. Reigel, E.W.: Parallelism Exposure and Exploitation, in L.C. Hobbs (cf. /1/), 417–438.

    Google Scholar 

  9. Riseman, E.M. / Foster, C.C.: The Inhibition of Potential Parallelism by Conditional Jumps, IEEE Trans. Computers C-21, 12 (Dec. 1972), 1405–1411.

    Google Scholar 

  10. Roucairol, G.: Transformation d'un programme sequentiel en programme parallele parfait, Les Actes du colloque sur la programmation, Springer, Paris, (April 1974), 231–234.

    Google Scholar 

  11. Shapiro, R.M. / Saint, H.: The Representation of Algorithms, Applied Data Research Inc., Final Techn. Report, RADC-TR-69-313, Vol 2 (1969).

    Google Scholar 

  12. Tjaden, G. / Flynn, M.J.: Detection and Parallel Execution of Independent Instructions, IEEE Trans. Computers C-19, 10 (Oct. 1970), 889–895.

    Google Scholar 

  13. Tjaden, G. / Flynn, M.J.: Representation of Concurrency with Ordering Matrices, IEEE Trans. Computers C-22, 8 (Aug. 1973), 752–761.

    Google Scholar 

  14. Urschler, G.: The Transformation of Flow Diagrams into Maximally Parallel Form, Sagamore Computer Conference on Parallel Processing, (1973), 38–46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abteilung Informatik, Universität Dortmund, Germany

    Eike Hagen Riedemann

Authors
  1. Eike Hagen Riedemann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Mülbacher

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Riedemann, E.H. (1975). Introducing parallelism into sequential programs. In: Mülbacher, J. (eds) GI — 5. Jahrestagung. GI 1975. Lecture Notes in Computer Science, vol 34. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07410-4_628

Download citation

  • DOI: https://doi.org/10.1007/3-540-07410-4_628

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07410-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation