Skip to main content

Parallelizing recursive logic programs through decomposition

  • Posters
  • Conference paper
  • First Online:
PARLE '92 Parallel Architectures and Languages Europe (PARLE 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 605))

Abstract

A variety of parallel execution models have been proposed, such as Restricted AND-parallelism, Stream AND-parallelism, Full AND/OR-parallelism etc. On the other hand there have been only few efforts to study the problems related to the (parallel) execution of recursive programs. Among the few studies the application of programtransformation-techniques appears to be more popular than specialized execution models suitable for recursive programs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Daniel Etiemble Jean-Claude Syre

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klingler, A., Penner, V. (1992). Parallelizing recursive logic programs through decomposition. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_145

Download citation

  • DOI: https://doi.org/10.1007/3-540-55599-4_145

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55599-5

  • Online ISBN: 978-3-540-47250-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics