A Methodology for Order-Sensitive Execution of Non-deterministic Languages on Beowulf Platforms

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

Volumn 2790, Issue , 2004, Pages 694-703

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

^a NEW MEXICO STATE UNIVERSITY   (United States)

^b UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

^c Dept Computer Science ^*

^d UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BEOWULF; NOVEL METHODOLOGY; PARALLEL EXECUTIONS; PENTIUM; PROLOG SYSTEMS; SIDE EFFECT;

COMPUTATIONAL LINGUISTICS;

EID: 35048900601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (11)

1. K.A.M. Ali and R. Karlsson. Full Prolog and Scheduling Or-Parallelism in Muse. In International Journal of Parallel Programming, 19(6), 1990.
2. L. Araujo. Full Prolog on a Distributed Architecture. In EuroPar, Springer, 1997.
3. G. Gupta et al. Techniques for Implementing Or-parallelism on DMPs. ICLP, MIT, 1999.
4. G. Gupta et al. Parallel Execution of Prolog Programs. TOPLAS, 23(4), 2001.
5. B. Hausman et al. Cut and Side-Effects in Or-Parallel Prolog. Conference on Fifth Generation Computer Systems, 1988. Springer Verlag.
6. E. Pontelli. Experiments in Parallel Execution of ASP. IEEE IPDPS, 2001.
7. D. Ranjan et al. Data Structures for Order-Sensitive Predicates. ACTA Informatica, 37(1):21-43, 2000.
8. R. Rocha et al. Parallel Prolog based on Stack Copying. EPIA, Springer, 1999.
9. P. Szeredi. Using dynamic predicates in an or-parallel prolog. ILPS, MIT, 1991.
10. K. Villaverde. Methodologies for OR-Parallelism on DMPs. PhD, NMSU, 2002.
11. K. Villaverde et al. Incremental Stack Splitting Mechanisms. IEEE ICPP, 2001.