Skip to main content
SpringerLink
Log in

Parallel operator schemata over variable arrays and the maximal parallelism problem

  • Published:
Cybernetics Aims and scope

Conclusions

We have introduced a certain universal class of schemata and proven a theorem which can be used to study parallelism transformations of various subclasses of schemata. The results can be generalized by introducing multidimensional arrays, removing the restrictions on the power of the sets Db and Rb, and in other directions. Of particular interest is the case of parallelism in indeterminate schemata, since in numerous problems indeterminacy is inherent to the program and its preservation under equivalent transformations is not less desirable than the preservation of parallelism. The proposed construction of maximally parallel schemata for the indeterminate case gives a determinate schema which computes the intersection of the outcomes of all computations in a given interpretation. To obtain a schema with the same indeterminacy level as the orginal schema, the look-ahead function should be updated.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature Cited

  1. R. M. Karp and R. E. Miller, “Parallel program schemata,” J. Comp. Sys. Sci., 3, No. 2 (1969).

    Google Scholar 

  2. R. E. Keller, “Parallel program schemata and maximal parallelism,” J. ACM, 20, Nos. 3, 4 (1973).

  3. V. E. Kotov, “Transforming operation schemata into asynchronous programs,” Doctoral Dissertation, Vychisl. Tsentra Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1970).

    Google Scholar 

  4. V. A. Val'kovskii, Desequencing algorithms for operation schemata,” Doctoral Dissertation, Vychisl. Tsentr. Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1974).

    Google Scholar 

  5. D. D. Chamberlin, “The ‘single-assignment’ approach to parallel processing,” Proc. 1971 Fall Joint Computer Conf., AFIPS Conf. Proc., Vol. 39 (1971).

  6. R. E. Keller, “A fundamental theorem of asynchronous parallel computation,” Proc. 1974 Sagamore Computer Conf. (1974).

  7. D. C. Luckham, D. M. R. Park, and M. S. Paterson, “On formalized computer programs,” J. Comput. Sys. Sci., 4, No. 3 (1970).

    Google Scholar 

  8. A. J. Bernstein, “Analysis of programs for parallel processing,” IEEE Trans. Electron. Comput., 15, No. 5 (1966).

    Google Scholar 

  9. G. Urschler, “The transformation of flow diagrams into maximally parallel form,” Proc. 1973 Sagamore Computer Conf. (1973).

  10. R. L. Constable and D. Gries, “On classes of program schemata,” Computer Sci. Dept. Cornell Univ. TR 71-105 (August 1971).

  11. J. B. Dennis, J. B. Fossin, and J. P. Linderman, “Data flow schemata,” Proc. Symp. on Programming Theory, Vol. 2, Izd. Vychisl. Tsentra Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1972).

    Google Scholar 

  12. V. A. Val'kovskii, “Parallelism of operation schemata over arrays,” Programmirovanie, No. 1 (1977).

  13. V. A. Val'kovskii, “On undecidability of maximal parallelism,” Kibernetika, No. 5 (1976).

Download references

Authors
  1. V. A. Val'kovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 52–63, September–October, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Val'kovskii, V.A. Parallel operator schemata over variable arrays and the maximal parallelism problem. Cybern Syst Anal 15, 661–673 (1979). https://doi.org/10.1007/BF01071216

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01071216

Keywords

Search

Navigation