Skip to main content
SpringerLink
Log in

Parallel algorithms and static analysis of parallel programs

  • Invited Papers
  • Conference paper
  • First Online:
Parallel Algorithms and Architectures

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

  • 136 Accesses

Abstract

Within the framework of the metamodel of parallel data processing two sub-classes of models are distinguished supported by original language means. These means allow special marking of processing into subprocesses and to define various interactions between the PA-branches of p-algorithms. The use of the proposed languages generally requires a special construction of p-algorithms, in which information dependent subprocesses must be ordered. It makes it possible to detect the uniqueness and deadlock freedom of p-programs by means of polynomial complexity static analysis of texts. It is important to note that uniqueness is ensured in the conditions of real calculation on a computer.

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.

Literature

  1. Apt, K.R.: A static analysis of CSP programs. Lecture Notes in Comp. Sci. (1984), 164, 1–17.

    Google Scholar 

  2. Ershov, A.P.: Operator algorithms. I. Problemy kibernetiki (1960), 3, 5–48.

    Google Scholar 

  3. Golovyashkina, L.V., Kolosova, Yu.I., Kosarev, Yu.G., Mirenkov, N.N.: Automation of parallel programming based on existing translators. Vychislitelnye sistemy. (1968), 30, 63–69.

    Google Scholar 

  4. Kerbel, V.G., Kolosova, Yu.I., Korneev, V.D., Krylov, E.G., Mirenkov, N.N.: Preprint, Institut Matematiki SOAN SSSR, Novosikirsk 1979.

    Google Scholar 

  5. Lipton, R., Snyder, L., Zalcstein, Y.: Comparative study of Models of Parallel Computation. 15th Ann.Symp.on Switching and Automata Theory (1974), 145–155.

    Google Scholar 

  6. Mirenkov, N.N.: Construction of unique and deadlock freedom parallel programs. Vychislitelnye sistemy (1985), 109, 3–27.

    Google Scholar 

  7. Taylor, R.N.: A General-Purpose Algorithm for Analyzing Concurrent Programs. Comm. ACM, 26 (1983) 5, 362–376.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center, Siberian Division, USSR Ao. Sci., 630090, Novosibirsk, USSR

    N. N. Mirenkov

Authors
  1. N. N. Mirenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas Albrecht Hermann Jung Kurt Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mirenkov, N.N. (1987). Parallel algorithms and static analysis of parallel programs. In: Albrecht, A., Jung, H., Mehlhorn, K. (eds) Parallel Algorithms and Architectures. Lecture Notes in Computer Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18099-0_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-18099-0_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18099-9

  • Online ISBN: 978-3-540-47760-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation