Skip to main content
SpringerLink
Log in

Why and how in the ElipSys OR-parallel CLP system

  • Paper Sessions
  • Conference paper
  • First Online:
PARLE '93 Parallel Architectures and Languages Europe (PARLE 1993)

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

Abstract

ElipSys is a programming system supporting a constraint logic programming (CLP) language and OR-parallel execution. These two features complement each other: CLP programming eases the writing of efficient search programs while OR-parallelism allows one to attain quasi-linear or super-linear speed-ups when the programs are executed on parallel machines. The speed-ups come without significant additional programming effort. This paper gives the rationale behind this combination, explains how it influences the design of the language and the implementation, and gives results providing evidence for the synergy of these two paradigms.

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. Khayri Ali. Incremental Gargage Collection for Or-parallel Prolog Based on WAM. In Gigalips Workshop, Stockholm, April 1989. SICS.

    Google Scholar 

  2. Khayri A.M Ali and Roland Karlsson. The Muse approach to OR-parallel Prolog. International Journal of Parallel Programming, 19(2):129–162, April 1990.

    MathSciNet  Google Scholar 

  3. Khayri A.M Ali and Roland Karlsson. Or-parallel speedups in a knowledge based system: on muse and aurora. In ICOT, editor, Fifth Generation Computing Systems, pages 165–180, Tokyo, 1992. ICOT.

    Google Scholar 

  4. U.C. Baron, J. Chassin de Kergommeaux, M. Hailperin, M. Ratcliffe, P. Robert, J.C. Syre, and H. Westphal. The parallel ECRC Prolog system PEPSys: An overview and evaluation results. In Proceedings FGCS'88, Tokyo, November 1988. Intel-national Conference on Fifth Generation Computer Systems.

    Google Scholar 

  5. Martin Bartusch. Optimierung von NetzPlaenen mit Anordnungsbeziehungen bei knappen Betriesbmitteln. PhD Thesis, MIP-8618, Fakultaet fuer Mathematik und Informatik, Universitaet Passau (Germany), 1983.

    Google Scholar 

  6. Dominic Clark, Chris Rawlings, Mike Reeve, and André Véron. Protein structure prediction with parallel constraint logic programming. Submitted to CABIOS, also available, as ECRC Technical Report, 1992.

    Google Scholar 

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

    Article  Google Scholar 

  8. M. Dinchas, H. Simonis, and P. Van Hentenryck. Solving Large Combinatorial Problems in Logic Programming. Journal of Logic Programming, 8(1–2):74–94, January-March 1990.

    Article  Google Scholar 

  9. Mehmet Dinchas, Pascal Van Hentenryck, Helmut Simonis, Abderrahmane Aggoun, Thomas Graf, and Françoise Berthier. The Constraint Logic Programming Language CHIP. In International Conference on Fifth Generation Computer Systems, Tokyo, Japan, December 1988.

    Google Scholar 

  10. Erik Hagersten, Anders Landin, and Seif Haridi. DDM — A Cache-Only Memory Architecture. IEEE Computer, pages 44–54, September 1992.

    Google Scholar 

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

    Google Scholar 

  12. 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 

  13. Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, Munich, Germany, pages 111–119. ACM, January 1987.

    Google Scholar 

  14. Daniel Lenoski, James Laudon, Kourosh Gharachorloo, Wol f Dietrich Weber, Anoop Gupta, John Hennessy, Mark Horowitz, and Monica S. Lam. The Stanford Dash Multiprocessor. IEEE Computer, pages 63–79, March 1992.

    Google Scholar 

  15. Ewing Lusk, David H. D. Warren, Seif Haridi, and al. The Aurora Or-parallel Prolog system. New Generation Computing, 7(2):243–271, 1990.

    Google Scholar 

  16. Christos Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization, pages 310–311. Prentice Hall, 1982.

    Google Scholar 

  17. Thierry Le Provost and Mark Wallace. Domain independent propagation. In International Conference on Fifth Generation Computer Systems, Tokyo, Japan, September 1992.

    Google Scholar 

  18. C.J. Skelton, C. Hammer, M. Lopez, M.J. Reeve, P. To wnsend, and K.F. Wong. EDS: A Parallel Computer System for Advanced Information Process ing. In Proceedings of PARLE'92, Conference on Parallel Architectures and Languages Europe, pages 3–20. Springer-Verlag, June 1992.

    Google Scholar 

  19. Peter Szeredi. Exploiting Or-parallelism in Optimisation Problems. In Krzysztof Apt, editor, Joint International Conference and Symposium on Logic Programming. MIT Press, 1992.

    Google Scholar 

  20. André Véron and Michel Dorochevsky. Binding Techniques and Garbage Collection for OR-parallel CLP systems. In PLILP'92, 1992.

    Google Scholar 

  21. D. H. D. Warren. The SRI model for or-parallel execution of Prolog — abstract design and implementation issues. In Symposium of Logic Programming, pages 92–102, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. European Computer-Industry, Research Centre, Arabellastrasse 17, 8000, Munich 81, Germany

    André Véron, Kees Schuerman, Mike Reeve & Liang -Liang Li

Authors
  1. André Véron
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kees Schuerman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mike Reeve
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Liang -Liang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode Mike Reeve Gottfried Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Véron, A., Schuerman, K., Reeve, M., Li, L.L. (1993). Why and how in the ElipSys OR-parallel CLP system. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-56891-3_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56891-9

  • Online ISBN: 978-3-540-47779-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation