Abstract
Many problems from science and engineering may be nicely formulated recursively. As a problem solving technique this is very effi- cient. 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 perfor- mance computing architectures.
This investigation has been carried out with the support of the European Union, ESPRIT project 21871 SAGA (Scientific Computing and Algebraic Abstractions) and a grant of computing resources from the Norwegian Supercomputer Committee.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Vytautas Čyras. Loop synthesis over data structures in program packages. Computer Programming, 7:27–50, 1983. (in Russian).
Vytautas Čyras and Magne Haveraaen. Modular programming of recurrencies: a comparison of two approaches. Informatica, 6(4):397–444, 1995.
Magne Haveraaen. How to create parallel programs without knowing it. In Proceedings of the 4th Nordic Workshop on Program Correctness-NWPC4, number 78 in Reports in Informatics, pages 165–176, P.O.Box 7800, N-5020 Bergen, Norway, April 1993.
Magne Haveraaen and Steinar Søreide. Solving recursive problems in linear time using constructive recursion. In Sverre Storøy, Said Hadjerrouit, et al., editors, Norsk Informatikk Konferanse-NIK’98, pages 310–321. Tapir, Trondheim, Norway, 1998.
W.L. Miranker and A. Winkler. Spacetime representations of computational structures. Computing, 32:93–114, 1983.
B.K. Szymanski, editor. Parallel Functional Languages and Compilers. ACM Press; New York / Addison Wesley; Reading, Mass., 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haveraaen, M. (2000). Efficient Parallelisation of Recursive Problems Using Constructive Recursion. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_104
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_104
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive