Concurrent Table Accesses in Parallel Tabled Logic Programs

Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic programming suggests that it might be amenable to parallel execution. On the other hand, the complexity of the tabling mechanism, and the existence of a shared resource, the table, may suggest that parallelism might be limited and never scale for real applications. In this work, we propose three alternative locking schemes to deal with concurrent table accesses, and we study their impact on the OPTYap parallel tabling system using a set of tabled programs.

• Type: Conference
• Year: 2004
• Where: EUROPAR
• Authors: Ricardo Rocha, Fernando M. A. Silva, Vítor Santos Costa
• Keywords: Concurrent Table Accesses, EUROPAR 2004, Tabled Logic Programming, Tabling