Synchronized parallel computation and slowdown of translators

  • Karel Čulik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 75)


The underlying parallel computers are assumed to be MIMD machines [Ku] with m≥1 synchronized and independent homogeneous processors [Ba], and parallel program schemes for them are introduced and studied. In section 1 usual (serial) program schemes and their function equivalence are introduced. In section 2 parallel program schemes are introduced as extensions of [Ma] and the main theorem is proved that each parallel program scheme can be translated into an m-parallel one where m≥1 is prescribed. In section 3 variable-free permit schemes without tests [Cu5] are introduced, and in section 4 their addressings are admitted. The functionality of permit schemes is investigated expecially for non-terminating processes (controlled by "semaphors" [Di], [LS]). In section 5 the parallel defect and the slowdown of a translator are introduced in all generality for arbitrary time unbounded program schemes.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ba]
    Baer, J. L.: Survey of some theoretical aspects of multiprocessing, Computing Surveys Vol. 5, No. 1, March 1977, pp. 31–80.Google Scholar
  2. [Br]
    Brainerd, W. B.: The Borroughs Scientific Processor, a colloquium of Comp. Sc. Dept. of Penn State, Nov. 10, 1977.Google Scholar
  3. [BS]
    Best, E., Schmid, H. A.: System of open paths in Petri nets. Proc. Symposium on Math. Found. of Computer Science 1975, Lecture Notes in Compt. Science 32, Springer 1975, p. 186–193.Google Scholar
  4. [Cu 1]
    Culik, K.: Syntactical definitions of program and flow diagram. Aplikace matematiky 18, 280–301 (1973).Google Scholar
  5. [Cu 2]
    Culik, K.: Combinatorial problems in theory of complexity of algorithmic nets without cycles for simple computers. Aplikace matematiky 16, 188–202 (1971).Google Scholar
  6. [Cu 3]
    Culik, K.: A note on complexity of algorithmic nets without cycles. Aplikace matemike 16, 297–301 (1971).Google Scholar
  7. [Cu 4]
    Culik, K.: Equivalence of parallel courses of algorithmic nets and precedence flow diagrams. Proc. Symposium on Mathematical Foundations of Computer Science, High Tatras, September 1973, p. 27–38.Google Scholar
  8. [Cu 5]
    Culik, K.: Almost control-free (indeterministic) parallel computation on permit schemes, 176–184, Proceedings of the 5th Annual ACM Symposium on Principles of Programming Languages, Tucson, January 1978.Google Scholar
  9. [DFL]
    Dennis, J. B., Fossen, J. B. Lenderman, J. P.: Data flow schemes, 187–216, Lecture notes in Comp. Sc. (1974), Springer.Google Scholar
  10. [Di]
    Dijkstra, E. W.: Co-operating sequential processes. In: Genuys, F. (ed.): Programming languages. London-New York: Academic Press, 1968, 42–112.Google Scholar
  11. [DM]
    Derschowitz, N. and Manna, Z.: Proving termination with multiset ordering, draft, March 1977, 31 pages.Google Scholar
  12. [Ha]
    Habermann, A. N.: Synchronization of communicating processes. Com. ACM 15, 171–176 (1972).Google Scholar
  13. [KM]
    Karp, R. M., Miller, R. E.: Parallel program schemata. J. Computer and System Sciences 3, 147–195 (1969).Google Scholar
  14. [Ku]
    Kuck, D. J.: A survey of Parallel Machine Organization and Programming, Computing Surveys, Vol. 9, No. 1, March 1977, 29–59.Google Scholar
  15. [LS]
    Lautenbach, K., Schmid, H. A.: Petri nets for proving correctness of concurrent process systems. In: Information Processing 74. Amsterdam: North Holland 1974, p. 187–191.Google Scholar
  16. [Ma]
    Manna, Z.: Program schemas. In: Aho, A. V. (ed.): Currents in the theory of computing. Englewood Cliffs (N.J.): Prentice-Hall 1973, p. 90–142.Google Scholar
  17. [Ne]
    Neumann, J. v.: Collected works V: Design of computers, Theory of automata and numerical analysis. Oxford-London-New York-Paris: Pergamon Press, 1963.Google Scholar
  18. [Pa]
    Pawlak, Z.: Programmed machines (Polish). Journal of Polish Academy of Science: Algorithmy V, 5–19 (1969).Google Scholar
  19. [Pe]
    Petri, C. A.: Concepts of net theory. Proc. Symposium on Mathematical Foundations of Computer Science, High Tatras, September 1973, p. 137–146.Google Scholar
  20. [Ru]
    Russle, R. M.: The CRAY-1 computer system, 63–72, CACM Vol. 21, No. 1, January 1978.Google Scholar
  21. [SU]
    Sethi, R., Ullman, J. D.: The generation of optimal code for arithmetic expressions. J. ACM 17, 715–728.Google Scholar

Copyright information

© Springer-Verlag 1979

Authors and Affiliations

  • Karel Čulik
    • 1
  1. 1.The Pennsylvania State UniversityUniversity Park

Personalised recommendations