Acta Informatica

, Volume 35, Issue 10, pp 875–909 | Cite as

On linear list recursion in parallel

  • Christoph Wedler
  • Christian Lengauer

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Christoph Wedler
    • 1
  • Christian Lengauer
    • 1
  1. 1. Fakultät für Mathematik und Informatik, Universität Passau, D–94030 Passau, Germany (e-mail: {wedler,lengauer}@fmi.uni-passau.de) DE

Personalised recommendations