Programming Solutions to the Algorithm Contraction Problem.
Philip A. Nelson, Lawrence Snyder · Proceedings of the International Conference on Parallel Processing · 1986
Abstract : Algorithms for the parallel solution of problems are usually designed assuming an unlimited number of processors. Physical parallel machines have a fixed number of processors. The algorithm contraction problem arises when an algorithm requires more processors than are available on the physical machine. This document presents tools for comparing algorithm contractions based on bottle neck communication paths. The authors apply these tools to minimum, matrix product and sorting.