Skip Navigation

The Computer Journal 1993 36(3):254-268; doi:10.1093/comjnl/36.3.254
© 1993 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by de Guzmán, I. P.
Right arrow Articles by Medina, E.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Pipelines for Divide-and-Conquer Functions

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

Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen's Gate, London SW7 2BZ, UK

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.

Received November 1991.

* Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen's Gate, London SW7 2BZ, UK


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.