Skip to main content

Looking for an approach to a theory of models for parallel computation

  • Conference paper
  • First Online:
International Symposium on Theoretical Programming

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

Abstract

The range of practical problems dealing with parallel and asynchronous computation is rather broad; in its turn it leads to a variety of models becoming subjects of mathematical research. Up to now corresponding researches have dealt with every model individually, the main attention, as a rule, being paid to structures realizing the control functions. Thus, in a sense, the model itself has not been investigated rather the syntactical means of its realization choosen by the author. The short-comings of this approach are evident.

Further progress in the theory demands that we create an apparatus allowing us to describe each model in the most general form and study it in the context of the sufficiently broad class of similar models. The system of notions presented in this report can be looked upon as some sketchy variant of such an apparatus, which to our opinion can serve, to a certain degree, as a basis for tis further development.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ershov, A.P., Flow-charts on Common and Distributed Memory, J. "Kibernetika", Kiev, N 4, 1968.

    Google Scholar 

  2. Narinyani, A.S., Asynchronous Computational Processes on Memory, Thesis, Novosibirsk, 1970.

    Google Scholar 

  3. Kotov, V.E., Transformations Flow-charts in Asynchronous Programs, Thesis, Novosibirsk, 1970.

    Google Scholar 

  4. Karp, R.M. and Miller, R.E., Parallel Program Schemata, Journal of Computer and Systems Sciences, v. 3, N 2, May 1969.

    Google Scholar 

  5. Slutz, D.R., Flow Graph Schemata, Rec. of the Project MAC conf. on Concurrent Systems and Parallel Computations, Woods Hole, Mass., June 1970.

    Google Scholar 

  6. Adams, D.A., A Computation Model with Data Flow Sequencing, CS-117, Computer Science Dept., Stanford Univ. Calif. Dec.1968.

    Google Scholar 

  7. Podlovchenko, R.I. Non-Determined Algorithm Schemata or R-Schemata, Report at the present Symposium.

    Google Scholar 

  8. Luconi, F.L., Asynchronous Computational Structures, MAC-TR-49, Thesis, Mass. Inst. of Technology, Cambridge, Mass. Feb. 1968.

    Google Scholar 

  9. Itkin, B.E., Logic-termal Equivalence of Program Schemata, Kibernetika, Kiev, N 1, 1972.

    Google Scholar 

  10. Keller, R.M., On Maximally Parallel Schemata, IEEE Conference Rec. of the 11-th Annual Symposium on Switching and Automata Theory, Oct. 1970.

    Google Scholar 

  11. Denning, P.J., On the Determinacy of Schemata, Rec. of the Project MAC conf. on Concurrent Systems and Parallel Computations, Woods Hole, Mass., June 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrei Ershov Valery A. Nepomniaschy

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Narinyani, A.S. (1974). Looking for an approach to a theory of models for parallel computation. In: Ershov, A., Nepomniaschy, V. (eds) International Symposium on Theoretical Programming. Lecture Notes in Computer Science, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06720-5_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-06720-5_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06720-7

  • Online ISBN: 978-3-540-38012-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics