Dynamic, parallel algorithms of the divide-and-conquer type are mapped onto static parallel computer architectures where the set of processors and their interconnections are fixed throughout the execution of a program. The approach taken is to transform a class of algorithms, expressed as functional programs, into a form that corresponds to a pipeline. The pipeline itself is then generated and the technique is illustrated by two sorting and one numeric list processing examples
['I. P. de Guzmán', 'Peter G. Harrison', 'E. Medina']
Pipelines for divide-and-conquer functions