Structuring of Parallel Algorithms
P. A. Gilmore · Journal of the ACM · 1968
The structuring of algorithms suitable for execution on parallel processors is discussed. Two examples of such algorithms are given. The first example exhibits a restructuring of Bellman's dynamic programming technique; the second presents a method of parsing MAD-type statements in parallel.