Achieving Scalability in Parallel Tabled Logic Programs

• Type: Article in International Conference Proceedings Book
• Date: 2002

Authors

Ricardo Rocha (Author) FCUP; Fernando M A Silva (Author) FCUP; Vítor Santos Costa (Author) FCUP

Conference proceedings International

Title: 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts Proceedings

Pages: 148-154

Indexing

ISI Web of Knowledge

Scopus - 2 Citations

Other information

Authenticus ID: P-008-KJE

DOI: 10.1109/IPDPS.2002.1015488

Abstract (EN): Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming because it addresses some of the most significant weaknesses of Prolog. Namely, it can guarantee termination for programs with the bounded term-size property. Tabled programs exhibit a more complex execution mechanism than traditional Prolog's left-to-right search with backtracking. The reason is that Prolog programs are highly recursive and generate multiple answers. This rather involved execution mechanism requires a more complex implementation than traditional Prolog. 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, argues that parallelism might be limited, and that performance for real applications might never scale. In this work we prove that parallel tabling is indeed scalable for real applications by experimenting the OPTYap parallel tabled system on a scalable shared-memory machine. © 2002 IEEE.

Language: English

Type (Professor's evaluation): Scientific