PALS: An or-parallel implementation of Prolog on Beowulf architectures

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

Volumn 2237, Issue , 2001, Pages 27-42

  Villaverde, K ^a   Pontelli, E ^a   Guo, H ^c   Gupta, G ^b  

^a NEW MEXICO STATE UNIVERSITY   (United States)

^b The University of Texas at Dallas   (United States)

^c STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; PARALLEL ARCHITECTURES;

BEOWULF; DISTRIBUTED IMPLEMENTATION; NOVEL TECHNIQUES; OR-PARALLELISM; PARALLEL IMPLEMENTATIONS; PARALLEL LOGIC; SPLITTING METHOD;

COMPUTER CIRCUITS;

EID: 84937205492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45635-x_10     Document Type: Conference Paper

References (18)

1. K.A.M. Ali and R. Karlsson. The Muse Or-parallel Prolog Model and its Performance. In N. American Conf. on Logic Prog., pages 757–776. MIT Press, 1990.
2. K.A.M. Ali, R. Karlsson, and S. Mudambi Performance of Muse on Switch-Based Multiprocessors Machines. New Generation Computing, 11(1):81-103, 1992.
3. L. Araujo and J. Ruz. A Parallel Prolog System for Distributed Memory. J. of Logic Programming, 33(1):49–79, 1998.
4. H. Babu. Porting MUSE on ipsc 860. Master’s thesis, NMSU, 1996.
5. A.J. Beaumont and D. H. D. Warren. Scheduling Speculative Work in Or-Parallel Prolog Systems. In ICLP, pages 135–149, 1993. MIT Press.
6. V. Benjumea and J.M. Troya. An OR Parallel Prolog Model for Distributed Memory Systems. In PLILP, pages 291–301, 1993. Springer Verlag.
7. J. Briat et al. OPERA: Or-Parallel Prolog System on Supernode. In Implementations of Distributed Prolog, pages 45–64. J. Wiley & Sons, New York, 1992.
8. L.F. Castro et al. DAOS: Scalable And-Or Parallelism. In Euro-Par, pages 899–908, 1999. Springer Verlag.
9. W-K. Foong. Combining and- and or-parallelism in Logic Programs: a distributed approach. PhD thesis, University of Melbourne, 1995.
10. G. Gupta and E. Pontelli. Optimization Schemas for Parallel Implementation of Nondeterministic Languages and Systems. In IPPS, 1997. IEEE Computer Society.
11. G. Gupta and E. Pontelli. Stack-splitting: A Simple Technique for Implementing Or-parallelism on Distributed Machines. In ICLP. MIT Press, pages 290–304, 1999.
12. G. Gupta, E. Pontelli, M. Carlsson, M. Hermenegildo, and K.M. Ali. Parallel Execution of Prolog Programs: a Survey. ACM TOPLAS, 2001. (to appear).
13. L. Perron. Search Procedures and Parallelism in Constraint Programming. In PPDP, pages 346–360, 1999. Springer Verlag.
14. E. Pontelli and O. El-Kathib. Construction and Optimization of a Parallel Engine for Answer Set Programming. In PADL, pages 288–303, 2001. Springer Verlag.
15. D. Ranjan, E. Pontelli, and G. Gupta. On the Complexity of Or-Parallelism. NGC, 17(3):285–308, 1999.
16. R. Rocha, F. Silva, and V. Santos Costa. YapOr: an Or-Parallel Prolog System based on Environment Copying. In EPPIA, pages 178–193, 1999, Springer Verlag.
17. C. Schulte. Parallel Search Made Simple. In TRICS, number TRA9/00, pages 41–57, University of Singapore, 2000.
18. F. Silva and P. Watson. Or-Parallel Prolog on a Distributed Memory Architecture. Journal of Logic Programming, 43(2):173–186, 2000.