Skip to main content
SpringerLink
Log in

Scheduling of OR-parallel Prolog on a scalable, reconfigurable, distributed-memory multiprocessor

  • Submitted Presentations
  • Conference paper
  • First Online:
PARLE '91 Parallel Architectures and Languages Europe (PARLE 1991)

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

Abstract

The OPERA project aims at efficiently implementing Prolog on a scalable, reconfigurable distributed-memory architecture. The OPERA computational model exploits OR-parallelism following a classical multisequential approach: each processor executes a complete Prolog engine based on the WAM; inter-processor communication is reduced to work installation, the complete state of an active Prolog engine being copied to an idle one. Scheduling is performed by a hierarchy of specialized processors, operating in parallel of the computation of the Prolog program. To avoid costly synchronization, schedulers use an approximate representation of the state of the system. Because of the important overhead of task installation in a distributed-memory system, only workers having a large amount of work to execute can give work to idle workers. Several dynamic work regulation strategies have been designed and are currently being tested. The prototype implementation of OPERA on a transputer-based Supernode is one of the most efficient existing Prolog implementations on the transputer and reaches effective speed-ups in parallel over efficient sequential Prolog systems.

This work has been partially sponsored by the Centre National d'Etude des Télécommunications (CNET) and ESPRIT project P1085.

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. K. A. M. Ali and R. Karlsson. The Muse or-parallel prolog model and its performance. In Proceedings of the NACLP'90, Austin, 1990.

    Google Scholar 

  2. P.G. Bosco, C. Cecchi, C. Moiso, M. Porta, and G. Sofi. Logic and functional programming on distributed memory architectures. In Proceedings of the 6 th International Conference on Logic Programming, pages 325–339, Jerusalem, June 1990.

    Google Scholar 

  3. U. 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, Nov-Dec 1988. International Conference on Fifth Generation COmputer Systems.

    Google Scholar 

  4. R. Butler, T. Disz, E. Lusk, R. Olson, R. Overbeek, and R. Stevens. Scheduling or-parallelism: An argonne perspective. In K. Bowen R. Kowalski, editor, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1590–1605, Seattle, August 1988.

    Google Scholar 

  5. J. Briat, M. Favre, D. Fort, Y. Langué, and M. Santana. Parx: a parallel operating system for transputer-based machine. In Proceedings 10th. Occam User Group, 1989.

    Google Scholar 

  6. Anthony Beaumont, Muthuraman, and Péter Szeredi. Scheduling orparallelism in Aurora with the bristol scheduler. Technical Report TR-90-04, University of Bristol, March 1990.

    Google Scholar 

  7. Per Brand. Wavefront scheduling. Internal report, SICS, Gigalips project, 1988.

    Google Scholar 

  8. T. Chikayama. Current status of research and development of parallel inference systems in fifth generation computer systems. Pre-conference Workshop on Parallel Logic Programming, 7th International Conference on Logic Programming, ICLP'90, Eilat, june 1990.

    Google Scholar 

  9. Charles CLOS. A study of non blocking switching networks. In Chuan-Lin Wu and Tse-Yun Fen, editors, Tutorial Interconnexion Networks for parallel and Distribued Processsing. IEEE Computer Society Press, 1984. republished from The Bell System Technical Journal, March 1953 pp406–424.

    Google Scholar 

  10. A. Calderwood and P. Szeredi. Scheduling or-parallelism in Aurora. In Proceedings of the 6 th International Conference on Logic Programming, Lisboa, June 1989.

    Google Scholar 

  11. J.G. Harp, C.R. Jesshope, T. Muntean, and C. Whitby-Stevens. The development and application of a low cost high performance multiprocessor machine. In Proceedings ESPRIT'86: Results and Achievements. Elsevier Science Publishers, 1986.

    Google Scholar 

  12. E. Lusk, R. Butler, T. Disz, R. Olson, R. Overbeek, R. Stevens, D.H.D. Warren, A. Calderwodd, P. Szeredi, S. Haridi, P. Brand, M. Carlson, A. Ciepielewski, and B. Hausman. The Aurora or-parallel prolog system. In Proceedings FGCS'88, Tokyo, Nov–Dec 1988. International Conference on Fifth Generation Computer Systems.

    Google Scholar 

  13. H. Masuzawa and et al. Kabu wake parallel inference mechanism and its evaluation. In 1986 FJCC, pages 955–962. IEEE, November 1986.

    Google Scholar 

  14. Michel Raynal. Networks and Distributed Computation. Concepts, Tools and Algorithms. Computer Systems Series. The MIT Press, 1988. ISBN 18130-4 RAYNH.

    Google Scholar 

  15. E. Shapiro. The family of concurrent logic programming languages. acm computing surveys, 21(3), september 1989.

    Google Scholar 

  16. M. Hermenegildo S. K. Debray, N-W Lin. Task granularity analysis in logic programs. In Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation, White Plains, New York, June 20–22 1990.

    Google Scholar 

  17. A. Touzene and B. Plateau. Mesures de performance des communications du meganode à 128 transputers. Technical report, LGI-IMAG, project CMaP, 46, avenue Félix Viallet, 38031 Grenoble Cédex, France, 1990.

    Google Scholar 

  18. David H. D. Warren. An Abstract Prolog Instruction Set. Technical Report tn309, SRI, October 1983.

    Google Scholar 

  19. D.H.D. Warren. The SRI model for or-parallel execution of prolog. Abstract design and implementation issues. In 4th Symposium on Logic Programming, pages 46–53, San Fransisco, Sept. 1987.

    Google Scholar 

  20. H. Westphal, P. Robert, J. Chassin, and J.-C. Syre. The PEPSys model: Combining backtracking, and-and or-parallelism. In 4th Symposium on Logic Programming, pages 436–448, San Fransisco, Sept. 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Projet CMaP, LGI, BP 53 X, 38041, Grenoble Cedex

    J. Briat, M. Favre & C. Geyer

  2. CAP-Gemini-Innovation, 7, chemin du Vieux Chêene, ZIRST, F-38240, Meylan

    J. Chassin de Kergommeaux

  3. CPGCC-USRGS, University of Porto Alegre, caixa postal 1501, 90000, Porto Alegre RS, Brasil

    C. Geyer

Authors
  1. J. Briat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Favre
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Geyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. Chassin de Kergommeaux
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Emile H. L. Aarts Jan van Leeuwen Martin Rem

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag

About this paper

Cite this paper

Briat, J., Favre, M., Geyer, C., Chassin de Kergommeaux, J. (1991). Scheduling of OR-parallel Prolog on a scalable, reconfigurable, distributed-memory multiprocessor. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) PARLE '91 Parallel Architectures and Languages Europe. PARLE 1991. Lecture Notes in Computer Science, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54152-7_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-54152-7_76

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54152-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation