YapOr: An or-parallel prolog system based on environment copying

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1695, Issue , 1999, Pages 178-192

  Rocha, Ricardo ^a   Silva, Fernando ^a   Costa, Vítor Santos ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Parallel logic programming; Performance; Scheduling

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; LOGIC PROGRAMMING; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

BENCHMARK PROGRAMS; COPYING MODELS; MEMORY ORGANIZATIONS; PARALLEL LOGIC PROGRAMMING; PARALLEL PROCESSING; PARALLEL SYSTEM; PERFORMANCE; PROLOG PROGRAMS;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84867424701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48159-1_13     Document Type: Conference Paper

References (16)

1. K. A. M. Ali and R. Karlsson. Full Prolog and Scheduling OR-Parallelism in Muse. International Journal of Parallel Programming, 19(6):445-475, Dec. 1990.
2. K. A. M. Ali and R. Karlsson. The Muse Approach to OR-Parallel Prolog. International Journal of Parallel Programming, 19(2):129-162, Apr. 1990.
3. K. A. M. Ali and R. Karlsson. Scheduling Speculative Work in Muse and Performance Results. International Journal of Parallel Programming, 21(6), Dec. 1992.
4. A. Beaumont, S. M. Raman, and P. Szeredi. Scheduling Or-Parallelism in Aurora with the Bristol Scheduler. In PARLE’91, LNCS. Springer-Verlag, Apr. 1991.
5. A. Calderwood and P. Szeredi. Scheduling Or-parallelism in Aurora - the Manchester Scheduler. In ICLP’89, pages 419-435, Lisbon, June 1989. The MIT Press.
6. M. Correia, F. Silva, and V. S. Costa. The SBA: Exploiting Orthogonality in AND-OR Parallel Systems. In ILPS’97, Port Jefferson, Oct. 1997. The MIT Press.
7. L. Damas, V. S. Costa, R. Reis, and R. Azevedo. YAP User’s Guide and Reference Manual. Centro de Inform tica da Universidade do Porto, 1989.
8. G. Gupta, K. A. M. Ali, M. Carlsson, and M. Hermenegildo. Parallel Execution of Prolog Programs: A Survey. Mar. 1996. Preliminary Version.
9. G. Gupta and B. Jayaraman. Analysis of Or-parallel Execution Models. ACM Transactions on Programming Languages, 15(4):659-680, Sep. 1993.
10. Roland Karlsson. A High Performance OR-parallel Prolog System. PhD thesis, The Royal Institute of Technology, Stockholm, Mar. 1992.
11. E. Lusk and et. all. The Aurora Or-parallel Prolog System. In FGCS’88, pages 819-830. ICOT, Tokyo, Nov. 1988.
12. R. Rocha, F. Silva, and V. S. Costa. On Applying Or-Parallelism to Tabled Evaluations. In TLP’97, Leuven, Belgium, July 1997.
13. R. Rocha, F. Silva, and V. S. Costa. Or-Parallelism within Tabling. In PADL’99, number 1551 in LNCS, pages 137-151. Springer-Verlag, 1998.
14. Fernando M. A. Silva. An Implementation of Or-Parallel Prolog on a Distributed Shared Memory Architecture. PhD thesis, Dept. of Computer Science, Univ. of Manchester, Sep. 1993.
15. R. Sindaha. The Dharma Scheduler - Definitive Scheduling in Aurora on Multiprocessor Architecture. Tech. Report, Dept. of Computer Science, Univ. of Bristol, Nov. 1991.
16. David H. D. Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI International, Sep. 1983.