Efficient Parallelisation of Recursive Problems Using Constructive Recursion (Research Note)

Authors:
Magne Haveraaen
Affiliations:
-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 2
Cited 1

Spacetime representations of computational structures

Computing
Parallel functional languages and compilers

Parallel functional languages and compilers

Programmable data dependencies and placements

DAMP '12 Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many problems from science and engineering may be nicely formulated recursively. As a problem solving technique this is very efficient. Due to the high cost of executing recursively formulated programs, typically an exponential growth in time complexity, this is rarely done in practice. Constructive recursion promises to deliver a space and time optimal compilation of recursive programs. The constructive recursive scheme also straight forwardly generates parallel code on high performance computing architectures.