Advertisement

Efficient Parallelisation of Recursive Problems Using Constructive Recursion

  • Magne Haveraaen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1900)

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.

Keywords

Recursive Call Parallel Code Target Computer Modular Decomposition Data Dependency Graph 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Vytautas Čyras. Loop synthesis over data structures in program packages. Computer Programming, 7:27–50, 1983. (in Russian).Google Scholar
  2. [2]
    Vytautas Čyras and Magne Haveraaen. Modular programming of recurrencies: a comparison of two approaches. Informatica, 6(4):397–444, 1995.zbMATHGoogle Scholar
  3. [3]
    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
  4. [4]
    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
  5. [5]
    W.L. Miranker and A. Winkler. Spacetime representations of computational structures. Computing, 32:93–114, 1983.CrossRefMathSciNetGoogle Scholar
  6. [6]
    B.K. Szymanski, editor. Parallel Functional Languages and Compilers. ACM Press; New York / Addison Wesley; Reading, Mass., 1991.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Magne Haveraaen
    • 1
  1. 1.Institutt for InformatikkUniversitetet i Bergen, HiBBergenNorway

Personalised recommendations