Pipelines for Divide-and-Conquer Functions | Zendy

Inma P. de Guzmán | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Pipelines for Divide-and-Conquer Functions

Author(s) -

Inma P. de Guzmán

Publication year - 1993

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/36.3.254

Subject(s) - divide and conquer algorithms , computer science , pipeline (software) , parallel computing , sorting , class (philosophy) , set (abstract data type) , pipeline transport , theoretical computer science , algorithm , programming language , artificial intelligence , environmental engineering , engineering

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research