Efficient Parallelisation of Recursive Problems Using Constructive Recursion
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.
Unable to display preview. Download preview PDF.
- Vytautas Čyras. Loop synthesis over data structures in program packages. Computer Programming, 7:27–50, 1983. (in Russian).Google Scholar
- 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.Google Scholar
- 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.Google Scholar