Constraint handling, garbage collection and execution model issues in ElipSys

  • Michel Dorochevsky
  • Kees Schuerman
  • André Véron
  • Jiyang Xu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 569)


This paper presents the constraint handling and garbage collection parts of ElipSys and gives an overview of its execution model. ElipSys is a logic programming system being developed at ECRC. It combines parallelism, constraint satisfaction on finite domains, and tight database coupling. Constraints in ElipSys are handled in a way that significantly improves the expressiveness and declarativeness of logic programming and offer an increase in efficiency through parallelism. The garbage collector tackles the additional complexity of the parallel execution environment and takes into consideration also the data generated by the constraint solver. The ElipSys execution model is designed to be appropriate to a range of parallel architectures, from shared to distributed memory machines.


Logic Programming Garbage Collection Execution Model Finite Domain Constraint Solver 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Aggoun and N. Beldiceanu. Time Stamps Techniques for the Trailed Data in Constraint Logic Programming Systems. In Seminaire de Trégastel sur la Programmation en Logique, France, 1990.Google Scholar
  2. [2]
    Khayri A.M. Ali. Incremental Garbage Collection for Or-Parallel Prolog based on WAM. In Proceedings of the Gigalips Workshop, April 1989.Google Scholar
  3. [3]
    Karen Appleby, Mats Carlsson, Seif Haridi, and Sahlin Dan. Garbage Collection for Prolog Based on WAM. Communications of the ACM, 31(6):719–741, June 1988.Google Scholar
  4. [4]
    U. C. Baron, J. Chassin de Kergommeaux, M. Hailperin, M. J. Ratcliffe, P. Robert, J.-C. Syre, and H. Westphal. The Parallel ECRC Prolog System PEPsys: An Overview and Evaluation Results. In Proceedings of the 5th Generation Computer Systems Conference, November 1988.Google Scholar
  5. [5]
    Jorge B. Bocca. MegaLog — A platform for developing Knowledge Base Management Systems. In Proceedings of the International Symposium on Database Systems for Advanced Applications, pages 374–380, April 1991.Google Scholar
  6. [6]
    Lothar Borrmann. A virtually shared memory model with customized coherency. In Peter Mueller-Stoy, editor, 11th ITG/GI Conference on Architecture of Computing Systems. VDE Verlag — ISBN: 3-8007-1688-7, March 1990.Google Scholar
  7. [7]
    Sergio A. Delgado-Rannauro, Michel Dorochevsky, Kees Schuerman, André Véron, and Jiyang Xu. ElipSys: An Integrated Platform for Building Large Decision Support Systems. Technical Report DPS-104, ECRC, January 1991.Google Scholar
  8. [8]
    Sergio A. Delgado-Rannauro, Michel Dorochevsky, Kees Schuerman, André Véron, and Jiyang Xu. ElipSys Execution Model. Technical Report DPS-86, ECRC, January 1991.Google Scholar
  9. [9]
    M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. In Proceedings of the International Conference on 5th Generation Computer Systems, pages 693–702, December 1988.Google Scholar
  10. [10]
    M. Dorochevsky, M. Paci, M. J. Reeve, K. Schuerman, A. Véron, K.-F. Wong, and J. Xu. EDS: A Host for ESQL and ElipSys. In Proceedings of the 3rd Workshop on Parallel and Distributed Processing, Sofia, Bulgaria, April 1991. Elsevier Science Publisher B.V.Google Scholar
  11. [11]
    Michel Dorochevsky. Garbage Collection in the OR-Parallel Logic Programming System ElipSys. Technical Report DPS-85, ECRC, March 1991.Google Scholar
  12. [12]
    G. Haworth, S. Leunig, C. Hammer, and Reeve M. The European Declarative System, Database and Languages. IEEE Micro, 10(6):20–23, December 1990.Google Scholar
  13. [13]
    Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.Google Scholar
  14. [14]
    Pascal Van Hentenryck. Parallel constraint 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
  15. [15]
    Kai Li and Paul Hudak. Memory coherence in shared virtual memory systems. ACM Transactions on Computer Systems, 7(4):321–359, November 1989.Google Scholar
  16. [16]
    David H.D. Warren. An Abstract Prolog Instruction Set. Technical Note TN-309, SRI, October 1983.Google Scholar
  17. [17]
    David S. Warren. Efficient Prolog memory management for flexible control strategies. In The International Symposium on Logic Programming, pages 198–202, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Michel Dorochevsky
    • 1
  • Kees Schuerman
    • 1
  • André Véron
    • 1
  • Jiyang Xu
    • 1
  1. 1.Parallel and Distributed Systems GroupEuropean Computer-Industry Research CentreMünchen 81Germany

Personalised recommendations