Aspects of unbounded parallelism

Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)


The parallel program schemata, introduced by Karp and Miller [1], are considered for an unbounded number of operations and their decidability, result for determinacy is extended to this case under certain restrictions on the nature of the conflicts. The work of Keller [2] on maximal parallelism is discussed and an alternative approach to this problem is proposed which leads to a simple and fast solution algorithm for the general scheduling problem for unbounded parallelism. In contrast to this the general scheduling problem for bounded parallelism is NP-complete as proven in Ullman [3].


Execution Time Memory Location Precedence Graph Unbounded Number Maximal Parallelism 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Karp, R.M. and Miller, R.E. Parallel program schemata. Journal of Computer and System Sciences, 3, 147–195 (1969).Google Scholar
  2. [2]
    Keller, R.M. Parallel program schemata and maximal parallelism. Journal of the ACM, 20, 514–537 and 696–710 (1973).CrossRefGoogle Scholar
  3. [3]
    Ullman, J.D. NP-complete scheduling problems. Journal of Computer and System Sciences, 10, 384–393 (1975).Google Scholar
  4. [4]
    Aho, A.V., Hopcroft, J.E. and Ullman, J.D. The Design and Analysis of Computer Algorithms. Reading, Mass. (1974).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • G. Gati

There are no affiliations available

Personalised recommendations