Abstract.
We propose a classification for a set of linearly recursive functions, which can be expressed as instances of a skeleton for parallel linear recursion, and present new parallel implementations for them. This set includes well known higher-order functions, like Broadcast, Reduction and Scan, which we call basic components. Many compositions of these basic components are also linearly recursive functions; we present transformation rules from compositions of up to three basic components to instances of our skeleton. The advantage of this approach is that these instances have better parallel implementations than the compositions of the individual implementations of the corresponding basic components.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 27 May 1997 / Revised version: 17 March 1998
Rights and permissions
About this article
Cite this article
Wedler, C., Lengauer, C. On linear list recursion in parallel . Acta Informatica 35, 875–909 (1998). https://doi.org/10.1007/s002360050146
Issue Date:
DOI: https://doi.org/10.1007/s002360050146