Aspects of unbounded parallelism
The parallel program schemata, introduced by Karp and Miller , 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  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 .
KeywordsExecution Time Memory Location Precedence Graph Unbounded Number Maximal Parallelism
Unable to display preview. Download preview PDF.
- Karp, R.M. and Miller, R.E. Parallel program schemata. Journal of Computer and System Sciences, 3, 147–195 (1969).Google Scholar
- Ullman, J.D. NP-complete scheduling problems. Journal of Computer and System Sciences, 10, 384–393 (1975).Google Scholar
- Aho, A.V., Hopcroft, J.E. and Ullman, J.D. The Design and Analysis of Computer Algorithms. Reading, Mass. (1974).Google Scholar