Structuring of Parallel Algorithms

  • Authors:
  • P. A. Gilmore

  • Affiliations:
  • Goodyear Aerospace Corporation, Akron, Ohio

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1968

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.