Skip to main content
SpringerLink
Log in

Binding techniques and garbage collection for OR-parallel CLP systems

  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1992)

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

Abstract

ElipSys is the first system combining in one environment OR-parallel execution facilities, advanced AND-execution paradigms such as coroutining and constraints satisfaction on finite domains and a complete garbage collector. This paper reports on the issues involved in combining these features into one system. A data structure called consecutively updatable field is depicted which fulfills the concomitant requirements of OR-parallelism, non left-to-right computation rules and garbage collection.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abderrahmane Aggoun and Nicolas Beldiceanu. Time Stamps Techniques for the Trailed Data in Constraint Logic Programming Systems. In Seminaire de Tregastel sur la Programmation en Logique, France, 1990.

    Google Scholar 

  2. Karen Appleby et al. Garbage Collection for Prolog Based on WAM. Communications of the ACM, 31(6):719–741, 1988.

    Google Scholar 

  3. K. Ali and R. Karlsson. The Muse OR-Parallel Prolog Model and its Performance. In NACLP'90, Austin, Texas.

    Google Scholar 

  4. Khayri Ali. Incremental Gargage Collection for Or-parallel Prolog Based on WAM. In Gigalips Workshop, Stockholm, April 1989. SICS.

    Google Scholar 

  5. Y. Bekkers, B. Canet, O. Ridoux, and L. Ungaro. MALI: A memory with a Real-Time Garbage Collector for Implementing Logic Programming Languages. In International Symposium on Logic Programming, Salt Lake City, 1986.

    Google Scholar 

  6. U.C. Baron et al. The parallel ECRC Prolog system PEPSys: An overview and evaluation results. In FGCS'88, Tokyo, November 1988.

    Google Scholar 

  7. M. Carlsson. Freeze, indexing, and other implementation issues in the WAM. In ICLP'87, volume 2, pages 40–58, 1987.

    Google Scholar 

  8. Alain Colmerauer. An introduction to prolog-III. Communications of the ACM, 33(7):69–90, July 1990.

    Google Scholar 

  9. Vitor Santos Costa, David H.D Warren, and Rong Yang. The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model. In Koichi Furokawa, editor, ICLP'91, Paris, 1991. MIT Press.

    Google Scholar 

  10. Michel Dorochevsky. Garbage Collection in the OR-Parallel Logic Programming System ElipSys. Technical Report DPS-85, ECRC, March 1991.

    Google Scholar 

  11. M. Dincbas et al. Solving Large Combinatorial Problems in Logic Programming. Journal of Logic Programming, 8(1–2):74–94, January–March 1990.

    Google Scholar 

  12. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. In FGCS'88, Tokyo, Japan, December 1988.

    Google Scholar 

  13. ECRC. Sepia 3.1 User Manual, November 1991.

    Google Scholar 

  14. G. Gupta and B. Jayaraman. On Criteria for Or-parallel execution of Logic Programs. In NACLP'90, Austin, Texas, 1990. MIT Press.

    Google Scholar 

  15. Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.

    Google Scholar 

  16. Pascal Van Hentenryck. Parallel constraints satisfaction in logic programming: Preliminary results of CHIP within PEPSys. In Giorgio Levi and Maurizio Martelli, editors, ICLP'89, pages 165–180, Lisbon, June 1989. MIT Press.

    Google Scholar 

  17. Serge Le Huitouze. A new data structure for implementing extensions to Prolog. In PLILP'91. LNCS456, 1990.

    Google Scholar 

  18. Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In POPL'87, Munich, Germany. ACM, January 1987.

    Google Scholar 

  19. R. Butler et al. The Aurora OR-parallel Prolog system. In FGCS'88, Tokyo, November 1988.

    Google Scholar 

  20. Olivier Ridoux. Mali v06 Tutorial and Reference Manual. Internal report, 611, IRISA-INRIA-CNRS, October 1991.

    Google Scholar 

  21. Dan Sahlin and Mats Carlsson. Variable Shunting for the WAM. In 2nd NACLP Workshop on Logic Programming Architectures and Inplementations, Austin, Texas, 1990.

    Google Scholar 

  22. SICS. SICStus Prolog User's Manual, December 1990.

    Google Scholar 

  23. David S. Warren. Efficient Prolog memory management for flexible control strategies. In ISLP, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. European Computer-Industry Research Center, Arabellastr. 17, D-8000, Munich 81

    Michel Dorochevsky & André Véron

Authors
  1. Michel Dorochevsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. André Véron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurice Bruynooghe Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dorochevsky, M., Véron, A. (1992). Binding techniques and garbage collection for OR-parallel CLP systems. In: Bruynooghe, M., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1992. Lecture Notes in Computer Science, vol 631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55844-6_126

Download citation

  • DOI: https://doi.org/10.1007/3-540-55844-6_126

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55844-6

  • Online ISBN: 978-3-540-47297-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation