AESOP home

Publications

Pipelines for Divide-and-Conquer Functions

I. P. de Guzmán, Peter G. Harrison, E. Medina

Journal Article
The Computer Journal
Volume 36
Issue 3
pp.254–268
1993
Oxford University Press
DOI 10.1093/comjnl/36.3.254
Abstract

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.

Information from pubs.doc.ic.ac.uk/pipelines.