Skip to main content
SpringerLink
Log in

Theory of Parallel Programming. II. Survey of Formal Models

  • Chapter
Advances in Information Systems Science

Abstract

We begin with the following key remarks by D. R. Slutz, quoted from the opening paragraph of one of the papers surveyed (115): “This paper considers another ‘schemata’ model for use in representing and analyzing parallelism and parallel algorithms. Breaking with tradition, however, the model is not completely new and does not possess unique notation.”

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. A. Adams, “A Computational Model with Data Flow Sequencing,” CS-117, Computer Science Department, Stanford University, Stanford, California (December, 1968).

    Google Scholar 

  2. J. P. Anderson, Program structures for parallel processing, Commun. ACM 8 (12), 786–788 (1965).

    Google Scholar 

  3. G. S. Antoshchenkov, A possible technique for the organization of cycles in K-language, in “First All-Union Conference on Programming,” Session I, pp. 82–88, Kiev (1968) (in Russian).

    Google Scholar 

  4. M. A. Arbib and Y. Give’on, Algebra automata I: parallel programming as a prolegomena to the categorical approach, Information and Control 12 (4), 331–345 (1968).

    Google Scholar 

  5. E. Ashcroft and Z. Manna, “Formalization of Properties of Parallel Programs,” AIM-110, Artificial Intelligence Project, Stanford University, Stanford, California (February, 1970).

    Google Scholar 

  6. J. L. Baer and D. P. Bovet, Compilation of arithmetic expressions for parallel processing, in “Proc. IFIP Congress 1968, Edinburgh,” North-Holland Publishing Company, Amsterdam (1969).

    Google Scholar 

  7. J. L. E. Baer, “Graph Models of Computations in Computer Systems,” Ph.D. Thesis, University of California, Los Angeles (1968).

    Google Scholar 

  8. J. L. E. Baer and G. Estrin, Bounds for maximum parallelism in a bilogic graph model of computations, IEEE Trans. Computers C-18 (11), 1012–1014 (1969).

    Google Scholar 

  9. J. L. Baer, D. P. Bovet, and G. Estrin, Legality and other properties of graph models of computations, Journal ACM 17 (3), 543–554 (1970).

    Google Scholar 

  10. G. A. Bekishev, Parallelization of computer algorithms, in “Computer Systems,” No. 5, pp. 22–30, Nauka, Novosibirsk (1963) (in Russian).

    Google Scholar 

  11. A.J. Bernstein, Analysis of programs for parallel processing, IEEE Trans. Electronic Computers EC-15 (5), 757–763 (1966).

    Google Scholar 

  12. A. J. Bernstein and J. B. Johnston, Implementation of a parallel processing language, in “Proc. First Annual Princeton Conf. Information Sciences and Systems,” pp. 82–85, Princeton University (1967).

    Google Scholar 

  13. H. W. Bingham, D. A. Fisher, and W. L. Semon, “Detection of Implicit Computational Parallelism from Input-Output Sets,” Burroughs Corporation Tech. Rep. TR-66–4 (December, 1966).

    Google Scholar 

  14. H. W. Bingham, D. A. Fisher, and W. L. Semon, “Detection of Essential Ordering Implicit in Compiler Language Programs,” Burroughs Corporation Tech. Rep. TR-67–1 (February, 1967).

    Google Scholar 

  15. H. W. Bingham et al., “Automatic Detection of Parallelism in Computer Programs,” Burroughs Corporation Tech. Rep. TR-67–4 (November, 1967).

    Google Scholar 

  16. V. B. Borshchev and Yu. A. Shreider, Nonalgorithmic programming languages, Nauchno-Tekhnicheskaya Informatsiya (1964) (12), 17–21 (in Russian).

    Google Scholar 

  17. V. B. Borshchev and Yu. A. Shreider, Algorithms, programming languages, and dispositions, Kibernetika (1965) (4), 45–54 (in Russian).

    Google Scholar 

  18. T. H. Bredt, “A Survey of Models for Parallel Computing,” Tech. Rep. No. 8, Digital Systems Laboratory, Stanford University, Stanford, California (August, 1970).

    Google Scholar 

  19. S. N. Bushev, Use of Markov algorithms for the description of parallel processes, in “Aspects of Digital Computer Theory,” No. 2, pp. 54–62, Kiev (1969) (in Russian).

    Google Scholar 

  20. S. N. Bushev, An approach to the dissection of programs into functionally independent parts, Izv. Akad. Nauk SSSR, Tekhnicheskaya Kibernetika (1970) (5), 110–112 (in Russian).

    Google Scholar 

  21. D. Cohen, A parallel processes definition and control system, in “Proc. FJCC AFIPS,” Vol. 33, pp. 1043–1049 (1968).

    Google Scholar 

  22. L. L. Constantine, Control of sequence and parallelism in modular programs, in “Proc. SJCC AFIPS,” Vol. 32, pp. 409–414 (1968).

    Google Scholar 

  23. M. R. Conway, Design of a separable transition-diagram compiler, Commun. ACM 6 (7), 396–408 (1963).

    Google Scholar 

  24. M. R. Conway, A multiprocessor system design, in “Proc. FJCC AFIPS,” Vol. 24, pp. 139–146(1963).

    Google Scholar 

  25. A. J. Critchlow, Generalized multiprocessing and multiprogramming systems, in “Proc. FJCC AFIPS,” Vol. 24, pp. 107–126 (1963).

    Google Scholar 

  26. P. J. Denning, On the determinacy of schemata, in “Record of the Project MAC Conf. Concurrent Systems and Parallel Computations,” pp. 143–147, Woods Hole, Massachusetts (1970).

    Google Scholar 

  27. J. B. Dennis and E. C. Van Horn, Programming semantics for multiprogrammed computations, Commun. ACM 9 (3), 143–155 (1966).

    Google Scholar 

  28. J. B. Dennis, Programming generality, parallelism, and computer architecture, in “Proc. IFIP Congress 1968, Edinburgh,” pp. 484–492, North-Holland Publishing Company, Amsterdam (1969).

    Google Scholar 

  29. J. B. Dennis, “Proposed Research in Computation Structures,” Project MAC, Computation Structures Group Memo No. 50, Massachusetts Institute of Technology, Cambridge, Massachusetts (1970).

    Google Scholar 

  30. J. B. Dennis, “Informal Outline of a Theory of Parallel Computation Schemata for Simple Algorithms,” Project MAC, Computation Structures Group Memo No. 51, Massachusetts Institute of Technology, Cambridge, Massachusetts (1970).

    Google Scholar 

  31. E. W. Dijkstra, Solution of a problem in concurrent programming control, Commun. ACM 8 (9), 569 (1965).

    Google Scholar 

  32. E. W. Dijkstra, The structure of the “THE”-multiprogramming system, Commun. ACM 11 (5), 341–346 (1968).

    Google Scholar 

  33. E. W. Dijkstra, Co-operating sequential processes, in “Programming Languages” (F. Genuys, ed.), Academic Press, New York (1968).

    Google Scholar 

  34. W. S. Dorn, N. C. Hsu, and T. J. Rivlin, “Some Mathematical Aspects of Parallel Computation, “RC-647, IBM Research Center, Yorktown Heights, New York (1962).

    Google Scholar 

  35. V. F. D’yachenko, Exposition and analysis of objectives in algorithm schemata, in “Information Nets and Switching,” pp. 114–121, Moscow (1968) (in Russian).

    Google Scholar 

  36. A. P. Ershov, Principal directions in research on programming for computer systems, in “Second All-Union Conf. Homogeneous Computer Systems and Media,” pp. 17–21, Moscow (1969) (in Russian).

    Google Scholar 

  37. A. P. Ershov, “Parallel Programming, Stanford Artificial Intelligence Project,” Memo AIM-146, Rep. No. CS-224, Computer Science Department, Stanford University (July, 1971).

    Google Scholar 

  38. G. Estrin, Organization of computer systems—the fixed plus variable structure computer, in “Proc. WJCC AFIPS,” Vol. 17, pp. 33–40 (1960).

    Google Scholar 

  39. G. Estrin, B. Bussell, R. Turn, and J. Bibb, Parallel processing in a restructurable computer system, IEEE Trans. Electronic Computers EC-12 (6), 747–755 (1963).

    Google Scholar 

  40. G. Estrin and R. Turn, Automatic assignment of computations in a variable structure computer system, IEEE Trans. Electronic Computers EC-12 (6), 755–773 (1963).

    Google Scholar 

  41. E. V. Evreinov and Yu. G. Kosarev, Solution of problems on general-purpose computer systems, in “Computer Systems,” No. 17, pp. 106–164, Nauka, Novosibirsk (1965) (in Russian).

    Google Scholar 

  42. E. V. Evreinov and Yu. G. Kosarev, A matrix p-language for the description of parallel algorithms, in “Computer Systems,” No. 17, pp. 100–105, Nauka, Novosibirsk (1965) (in Russian).

    Google Scholar 

  43. E. V. Evreinov and Yu. G. Kosarev, “Homogeneous High-Speed General-Purpose Computer Systems,” Nauka, Novosibirsk (1966) (in Russian).

    Google Scholar 

  44. V. N. Fal’k and V. P. Kutepov, Functional graph-schemata and their equivalent transformations, in “First AU-Union Conf. Programming,” Session A, Kiev (1968) (in Russian).

    Google Scholar 

  45. D. A. Fisher, “Program Analysis for Multiprocessing,” Burroughs Corporation Tech. Rep. TR-67–2 (1967).

    Google Scholar 

  46. S. Gill, Parallel programming, Computer Journal No. 1, p. 2 (1958).

    Google Scholar 

  47. P. A. Gilmore, Structuring of parallel algorithms, Journal ACM 15 (2), 176–192 (1968).

    Google Scholar 

  48. J. A. Gosden Explicit parallel processing description and control in programs for multi-and uni-processor computers, in “Proc. FJCC AFIPS,” Vol. 29, pp. 651–660 (1966).

    Google Scholar 

  49. H. Hellerman, Parallel processing of algebraic expressions, IEEE Trans. Electronic Computers EC-15 (1), 82–91 (1966).

    Google Scholar 

  50. V. E. Itkin, Parallel flow charts, Kibernetika No. 1, pp. 47–50 (1971) (in Russian).

    Google Scholar 

  51. R. M. Karp and R. E. Miller, Properties of a model for parallel computations: determinacy, terminations, queueing, SIAM J. Appl. Math. 14, 1390–1411 (1966).

    Google Scholar 

  52. R. M. Karp and R. E. Miller, Parallel program schemata: a mathematical model for parallel computation, in “IEEE Conf. Rec. Eighth Annual Sympos. Switching and Automata Theory,” pp. 55–61 (1967).

    Google Scholar 

  53. R. M. Karp and R. E. Miller, Parallel program schemata, J. Computer and System Sci. 3 (2), 147–195 (1969).

    Google Scholar 

  54. R. M. Keller, On maximally parallel schemata, in “IEEE Conf. Rec. Eleventh Annual Sympos. Switching and Automata Theory,” pp. 32–50 (1970).

    Google Scholar 

  55. A. I. Khalilov, Algorithmic language for the description of parallel processes (ALGOPP), in “Programming Automation,” No. 3, Kiev (1968) (in Russian).

    Google Scholar 

  56. A. I. Khalilov,” Aspects of Programming Automation for Multiprocessor Computer Systems, “Dissertation for Candidate of Physicomathematical Sciences, Kiev (1972) (in Russian).

    Google Scholar 

  57. A. I. Khalilov, Automation of the parallelization of programs at the procedure-oriented language level, in “Proc. Sympos. Theory of Languages and Methods for the Construction of Programming Systems,” pp. 60–70, Kiev-Alushta (1972) (in Russian).

    Google Scholar 

  58. V. G. Khorshevskii, Algorithms for task assignment in a digital computer, in “Trans. Siberian Physicotechnical Institute,” No. 47, pp. 29–34, Tomsk (1965) (in Russian).

    Google Scholar 

  59. D. N. Kiknadze, Method for the structural analysis of parallel algorithms implemented in a homogeneous computer system, in “Computer Systems” (Symposium Proceedings), pp. 89–96, Nauka, Novosibirsk (1967) (in Russian).

    Google Scholar 

  60. E. A. Kopninskii, An algorithm for the parallel execution of programs, Zh. Vychislit. Matern, i Matem. Fiz. 9 (5), 1137–1144 (1969) (in Russian).

    Google Scholar 

  61. Yu. G. Kosarev, Procedure for the solution of problems in general-purpose computer systems, in “Computer Systems,” No. 17, pp. 61–99, Nauka, Novosibirsk (1965) (in Russian).

    Google Scholar 

  62. Yu. G. Kosarev, Parallelization by cycles, in “Computer Systems,” No. 24, pp. 3–19, Nauka, Novosibirsk (1967) (in Russian).

    Google Scholar 

  63. V. E. Kotov and A. S. Narin’yani, Asynchronous computational processes over a memory, Kibernetika, (1966) (3), 64–71 (in Russian).

    Google Scholar 

  64. V. E. Kotov, Certain problems in the transformation of flow charts into asynchronous programs, in “Proc. Third All-Union Conf. Information-Retrieval Systems and the Automated Processing of Scientific and Engineering Data,” Vol. 2, pp. 311–324, Moscow (1967) (in Russian).

    Google Scholar 

  65. V. E. Kotov and A. S. Narin’yani, Transformation of flow charts into asynchronous programs, in “Computer Systems” (Symposium Proceedings), pp. 97–101, Nauka, Novosibirsk (1967) (in Russian).

    Google Scholar 

  66. V. E. Kotov and A. S. Narin’yani, On transformation of sequential programs into asynchronous parallel programs, in “Proc. IFIP Congress 1968, Edinburgh,” pp. 351–357, North-Holland Publishing Company, Amsterdam (1969).

    Google Scholar 

  67. V. E. Kotov, “Transformation of Flow Charts into Asynchronous Programs,” Dissertation for Candidate of Physicomathematical Sciences, Novosibirsk (1970) (in Russian).

    Google Scholar 

  68. N. A. Krinitskii, The language of net schemata, in “Digital Computer Technology and Programming,” No. 3, pp. 3–17, Moscow (1967) (in Russian).

    Google Scholar 

  69. V. M. Kurochkin (ed.), “The Universal Programming Language pl/1,” Mir, Moscow (1968) (in Russian).

    Google Scholar 

  70. B. W. Lampson, A scheduling philosophy for multiprocessing systems, Commun. ACM 11 (5), 347–359 (1968).

    Google Scholar 

  71. M. Lehman, A survey and preliminary results concerning parallel processing and parallel processors, in “Proc. IEEE (12),” 1889–1901 (1966).

    Google Scholar 

  72. F. L. Luconi, Completely functional asynchronous computation structures, in “IEEE Conf. Rec. Eighth Annual Sympos. Switching and Automata Theory,” pp. 62–70 (1967).

    Google Scholar 

  73. F. L. Luconi, “Asynchronous Computational Structures,” MAC-TR-49, Thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts (February, 1968).

    Google Scholar 

  74. F. L. Luconi, Output functional computational structures, in “IEEE Conf. Rec. Ninth Annual Sympos. Switching and Automata Theory,” pp. 76–84 (1968).

    Google Scholar 

  75. E. Z. Lyubimskii, “Programming Algorithmization and the Method of Programming Programs,” Dissertation for Candidate of Physicomathematical Sciences, Moscow (1958) (in Russian).

    Google Scholar 

  76. Ya. Malushinskii and D. A. Pospelov, A method for the separation of independent fragments in a program schema, Trudy Moskov. Energet. Inst. (1964) (53), 111–116 (in Russian).

    Google Scholar 

  77. Z. Manna, The correctness of nondeterministic programs, Artificial Intelligence J. 1, No. 1 (1970).

    Google Scholar 

  78. D. Martin, “The Automatic Assignment and Sequencing of Computations on Parallel Processor Systems,” Ph.D. Thesis, University of California, Los Angeles (1963).

    Google Scholar 

  79. D. Martin, “The Automatic Assignment and Sequencing of Computations and Systems,” UCLA Rep. No. 66–4 (January, 1966).

    Google Scholar 

  80. D. Martin and G. Estrin, Experiments on models of computations and systems, IEEE Trans. Electronic Computers EC-16(1), 59–69 (1967).

    Google Scholar 

  81. D. Martin and G. Estrin, Models of computational systems—cyclic to acyclic graph transformations, IEEE Trans. Electronic Computers EC-16 (1), 70–79 (1967).

    Google Scholar 

  82. D. Martin and G. Estrin, Models of computations and systems—evaluation of vertex probabilities in graph models of computations, Journal ACM 14 (2), 281–299 (1967).

    Google Scholar 

  83. D. Martin and G. Estrin, Path length computations on graph models of computations, IEEE Trans. Computers C-18 (6), 530–536 (1969).

    Google Scholar 

  84. V. V. Martynyuk, Applications of the closure operation in graph analysis, Zh. Vychislit. Matern, i Matem. Fiz. 11 (6), 1605–1607 (1971) (in Russian).

    Google Scholar 

  85. K. Matsyashchik and D. A. Pospelov, Optimum level distribution of a program on parallel-operation computer devices, in “Information-Transmission Networks and Their Automation,” pp. 75–79, Moscow (1965) (in Russian).

    Google Scholar 

  86. J. C. Murtha, Highly parallel information processing systems, in “Advances in Computers,” Vol. 7, pp. 1–116, Academic Press, New York-London (1966).

    Google Scholar 

  87. A. S. Narin’yani, Translation of flow charts into asynchronous programs, in “Proc. Third All-Union Conf. Information-Retrieval Systems and the Automated Processing of Scientific and Engineering Information,” Vol. 2, pp. 296–310, Moscow (1967) (in Russian).

    Google Scholar 

  88. A. S. Narin’yani, “Asynchronous Computational Processes over a Memory,” Dissertation for Candidate of Physicomathematical Sciences, Novosibirsk (1970) (in Russian).

    Google Scholar 

  89. A. Opler, Procedure-oriented languages to facilitate parallel processing, Commun. ACM 8 (5), 306–307 (1965).

    Google Scholar 

  90. M. A. Osipova, “Problems in the Construction of a Machine-Oriented Language for a Computer Complex Having a Common Memory,” Dissertation for Candidate of Engineering Sciences, Moscow (1966) (in Russian).

    Google Scholar 

  91. M. S. Paterson and C. E. Hewitt, Comparative schematology, in “Record of the Project MAC Conf. Concurrent Systems and Parallel Computations,” pp. 119–127, Woods Hole, Massachusetts (1970).

    Google Scholar 

  92. S. S. Patil, “An Abstract Parallel Processing System,” M. S. Thesis, Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts (June, 1970).

    Google Scholar 

  93. C. A. Petri, Fundamentals of a theory of asynchronous information flow, in, “Proc. IFIP Congress 1962,” pp. 166–168, Munich (1962).

    Google Scholar 

  94. R. I. Podlovchenko, “Nondeterministic Algorithm Schemata and R-Schemata,” Preprint of Paper at the Internat. Sympos. Theoretical Programming, Novosibirsk (August 7–11, 1972) (in Russian).

    Google Scholar 

  95. D. A. Pospelov, Some mathematical problems arising in the concurrent operation of several computers, Trudy Moskov. Energet. Inst. (1964) (53), 97–110 (in Russian).

    Google Scholar 

  96. D. A. Pospelov, Theoretical problems associated with the consolidation of several computers into a unified system, in “Computer Systems” (Symposium Proceedings), pp. 56–62, Nauka, Novosibirsk (1967) (in Russian).

    Google Scholar 

  97. D. A. Pospelov, Classification of algorithm structures implemented on computer systems, Izv. Akad. Nauk SSSR, Tekhnicheskaya Kibernetika (1967) (5), 128–135 (in Russian).

    Google Scholar 

  98. D. A. Pospelov, Algorithm storage techniques for computer systems, in “Computer Systems” (Proc. First All-Union Conf. Computer Systems), No. 4, pp. 53–61, Novosibirsk (1968) (in Russian).

    Google Scholar 

  99. D. A. Pospelov, “Introduction to the Theory of Computer Systems,” Sovetskoe Radio, Moscow (1972) (in Russian).

    Google Scholar 

  100. C. V. Ramamoorthy and M. J. Gonzales, A survey of techniques for recognizing parallel processable streams in computer programs, in “Proc. FJCC AFIPS,” Vol. 35, pp. 1–15 (1969).

    Google Scholar 

  101. R. Reiter, “Initiation and Timing in a Model for Parallel Computation,” Tech. Rep. SEL-66–3, Department of Engineering, University of Michigan, Ann Arbor, Michigan (1966).

    Google Scholar 

  102. R. A. Reiter, “A Study of a Model for Parallel Computation,” Ph.D. Thesis, Department of Communication Sciences, University of Michigan, Ann Arbor, Michigan (June, 1967).

    Google Scholar 

  103. R. Reiter, Scheduling parallel computations, Journal ACM 15 (4), 590–599 (1968).

    Google Scholar 

  104. J. E. Rodriguez Bezos, “A Graph Model for Parallel Computations,” Ph.D. Thesis, Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts (September, 1967).

    Google Scholar 

  105. E. C. Russell, “Automatic Assignment of Computational Tasks in a Variable Structure Computer,” M. S. Thesis, University of California, Los Angeles (1963).

    Google Scholar 

  106. E. C. Russell, “Automatic Program Analysis,” Ph.D. Thesis, University of California, Los Angeles (1969).

    Google Scholar 

  107. J. D. Rutledge, “Parallel Processes, Schemata, and Transformations,” Draft for NATO Conf. Computer Architecture (September, 1969).

    Google Scholar 

  108. J. D. Rutledge, “Parallel Processes, Schemata, and Transformations,” RC-2912. IBM Research Center, Yorktown Heights, New York (June, 1970).

    Google Scholar 

  109. J. D. Rutledge, Program schemata as automata, in “IEEE Conf. Rec. Eleventh Annual Sympos. Switching and Automata Theory,” pp. 7–24 (1970).

    Google Scholar 

  110. E. S. Schwartz, An automatic sequencing procedure with application to parallel programming, Journal ACM 8 (4), 513–537 (1961).

    Google Scholar 

  111. K. V. Shakhbazyan and M. M. Lebedinskii, A functional algorithmic language, Trudy Matem. Inst. Akad. Nauk SSSR 96, 16–47 (1968) (in Russian).

    Google Scholar 

  112. K. V. Shakhbazyan, K-Language and parallel task-oriented algorithms, in “First All-Union Conf. Programming,” Session I, pp. 62–69, Kiev (1968) (in Russian).

    Google Scholar 

  113. K. V. Shakhbazyan, Choice of enumeration in parallel sequencing problems, in “Automatic Programming and Numerical Methods of Analysis” (Seminars in Mathematics, Vol. 18), pp. 13–15, Consultants Bureau, New York-London (1972).

    Google Scholar 

  114. D. R. Slutz, “The Flow Graph Schemata Model of Parallel Computation,” MAC-TR-51, Thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts (September, 1968).

    Google Scholar 

  115. D. R. Slutz, Flow graph schemata, in “Record of the Project MAC conf. Concurrent Systems and Parallel Computations,” pp. 129–141, Woods Hole, Massachusetts (September, 1968).

    Google Scholar 

  116. T. N. Smirnova and K. V. Shakhbazyan, On the design of a K-translator, in “First All-Union Conf. Programming,” Session I, pp. 70–81, Kiev (1968) (in Russian).

    Google Scholar 

  117. J. S. Squire, A translation algorithm for a multiple processor computer, in “Proc. Eighteenth ACM Nat. Conf.,” Denver, Colorado (1963).

    Google Scholar 

  118. H. S. Stone, One-pass compilation of arithmetic expressions for a parallel processor, Commun. ACM 10 (4), 220–222 (1967).

    Google Scholar 

  119. L. G. Tesler and H. J. Enea, A language design for concurrent processes, in “Proc. SJCC AFIPS,” Vol. 32, pp. 403–408 (1968).

    Google Scholar 

  120. D. Tsichritzis, Computational processes, in “Record of the Project MAC Conf. Concurrent Systems and Parallel Computation,” pp. 177–182, Woods Hole, Massachusetts (1970).

    Google Scholar 

  121. R. Turn, “Assignment of Inventory of a Variable Structure Computer,” Ph.D. Thesis, Department of Engineering, University of California, Los Angeles, California (1963).

    Google Scholar 

  122. T. A. Tushkina and K. V. Shakhbazyan, On the main concepts of parallel sequencing, in “Automatic Programming and Numerical Methods of Analysis” (Seminars Mathematics, Vol. 18), pp. 1–6, Consultants Bureau, New York-London (1972).

    Google Scholar 

  123. T. A. Tushkina and K. V. Shakhbazyan, The solution of certain parallel sequencing problems, in “Automatic Programming and Numerical Methods of Analysis” (Seminars in Mathematics, Vol. 18), pp. 7–12, Consultants Bureau, New York-London (1972).

    Google Scholar 

  124. E. Kh. Tyugu, Solution of problems on computation models, Zh. Vychislit. Matem. i Matem. Fiz. 10 (3), 716–733 (1970) (in Russian).

    Google Scholar 

  125. V. A. Tyuronkov, Algorithm for shortest-path determination, in “Computer Systems,” No. 6, pp. 41–44, Nauka, Novosibirsk (1963) (in Russian).

    Google Scholar 

  126. V. A. Val’kovskii, A method for the desequencing of flow charts, in “Proc. Sympos. Theory of Languages and Methods for the Construction of Programming Systems,” pp. 71–81, Kiev-Alushta (1972) (in Russian).

    Google Scholar 

  127. E. C. Van Horn, “Computer Design for Asynchronously Reproducible Multiprocessing,” MAC-TR-34, Thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts (November, 1966).

    Google Scholar 

  128. A. Van Wijngaarden (ed.), B. J. Mailloux, J. E. L. Peck, and C. H. A. Koster, Report on the algorithmic language ALGOL 68, Kibernetika No. 6, pp. 17–144 (1969); No. 1, pp. 12–160 (1970) (English original and Russian translation).

    Google Scholar 

  129. S. A. Volansky, “Graph Model Analysis and Implementation of Computational Sequences,” Ph.D. Thesis, School of Engineering and Applied Sciences, University of California, Los Angeles, California (June, 1970).

    Google Scholar 

  130. N. Wirth, A note on “Program structures for parallel processing,” Commun. ACM 9 (5), 320–321 (1966).

    Google Scholar 

  131. I. B. Zadykhailo, Organization of a cyclic computational process on a special type of parametric notation, Zh. Vychislit. Matem. i Matem. Fiz. 3 (2), 337–357 (1963) (in Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Center, Siberian Branch, Academy of Sciences of the USSR, Novosibirsk, Russia

    A. S. Narin’yani

Authors
  1. A. S. Narin’yani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Information Research, University of Florida, Gainesville, Florida, USA

    Julius T. Tou

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Plenum Press, New York

About this chapter

Cite this chapter

Narin’yani, A.S. (1976). Theory of Parallel Programming. II. Survey of Formal Models. In: Tou, J.T. (eds) Advances in Information Systems Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-8249-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-8249-6_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4615-8251-9

  • Online ISBN: 978-1-4615-8249-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation