EDMCC 1991: Distributed Memory Computing pp 412-421 | Cite as

A compiler for a distributed inference model

  • C. Percebois
  • N. Signès
  • P. Agnoletto
Alternative Execution Models
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 487)

Abstract

This paper summarizes the main features of the CIAM Virtual Machine designed to efficiently compile and run large logic programs. The CIAM instruction set is closely tied to the COALA architecture, a Message-Based Multiprocessor whose aim is to bring to bear the parallelism inherent to PROLOG programs i.e. without any programmer's direct intervention.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BAR88]
    U. Baron, J. Chassin de Kergommeaux, M. Hailperin, M. Ratcliffe, P. Robert, J.-C. Syre, H. Westphal — The Parallel ECRC Prolog System PEPSys: an Overview and Evaluation Results, Proceedings of the International Conference on Fifth Generation Computer Systems 1988, Tokyo, Japan, november 28-december 2, 1988, pp. 841–850.Google Scholar
  2. [BUT86]
    R. Butler, E.L. Lusk, R. Olson, R.A. Overbeek ANLWAM: A Parallel Implementation of the Warren Abstract Machine. Argonne National Laboratory, Argonne, IL 60439, 1986.Google Scholar
  3. [CLO85]
    W.F. Clocksin. Design and Simulation of a Sequential Prolog Machine. New Generation Computing, Vol. 3, no 1, 1985, pp. 101–120.Google Scholar
  4. [DOB84]
    T. Dobry, Tep. A Prolog Machine Architecture. Technical Note, Computer Science Division, University of California, Berkeley, 1984.Google Scholar
  5. [HER86]
    M.V. Hermenegildo. An Abstract Machine for the Restricted AND-Parallel Execution of Logic Programs. Third International Conference on Logic Programming, Imperial College, 1986, pp. 25–39.Google Scholar
  6. [HEW77]
    C. Hewitt. Viewing Control Structures as Patterns of Passing Messages. Artificial Intelligence (8), pp. 323–364, 1977.Google Scholar
  7. [KOW79]
    R. Kowalski. Logic for Problem Solving, Computer Science Library, Elsevier, 1979.Google Scholar
  8. [LUS88]
    E. Lusk, R. Butler, T. Disz, R. Olson, R. Overbeek, R. Stevens, D.H.D. Warren, A. Calderwood, P. Szeredi, S. Haridi, P. Brand, M. Carlsson, A. Ciepielewski, B. Hausman — The Aurora OR-Parallel Prolog System, Proceedings of the International Conference on Fifth Generation Computer Systems 1988, Tokyo, Japan, november 28-december 2, 1988, pp. 819–830.Google Scholar
  9. [PER87]
    C. Percebois, I. Futo, I. Durand, C. Simon, B. Bonhoure. Simulation Results of a Multiprocessor PROLOG Architecture based on a Distributed AND/OR Graph. International Joint Conference on Theory and Practice of Software Development, TAPSOFT'87, pp. 126–139, Pisa, Italy, 1987.Google Scholar
  10. [PER88]
    C. Percebois, I. Durand, I. Futo. Parallel Execution of Independent Subgoals. International Symposium on Distributed Systems, Methods and Applications, IFAC-DIS'88, Varna, Bulgaria, 1988.Google Scholar
  11. [WAR77]
    D.H.D. Warren. Implementing Prolog — Compiling Predicate Logic Programs. D.A.I. Research Reports no 39 and 40, University of Edinburgh, 1977.Google Scholar
  12. [WAR83]
    D.H.D. Warren. An Abstract Prolog Instruction Set. Technical Report 309, Artificial Intelligence Center, SRI International, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • C. Percebois
    • 1
  • N. Signès
    • 1
  • P. Agnoletto
    • 1
  1. 1.Institut de Recherche en Informatique de ToulouseUniversité Paul SabatierToulouse CedexFrance

Personalised recommendations