Batched Evaluation of Full-Sharing Multithreaded Tabling

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

Authors

Miguel Areias (Author) FCUP; Ricardo Rocha (Author) FCUP

Conference proceedings International

Title: LANGUAGES, APPLICATIONS AND TECHNOLOGIES, SLATE 2015

Pages: 113-124

4th International Symposium on Languages, Applications and Technologies (SLATE)

Complutense Univ Madrid, Fac Philol, Madrid, SPAIN, JUN 18-19, 2015

Indexing

ISI Web of Knowledge - 2 Citations

Scopus - 2 Citations

Other information

Authenticus ID: P-00K-32P

DOI: 10.1007/978-3-319-27653-3_11

Abstract (EN): Tabling is a technique that overcomes some limitations of traditional Prolog systems in dealing with redundant sub-computations and recursion. When tabling is combined with multithreading, we have the best of both worlds, since we can exploit the combination of higher declarative semantics with higher procedural control. To support this combination, the Yap Prolog system has, at engine level, multiple designs that vary from a No-Sharing design, where each thread allocates fully private tables, to a Full-Sharing (FS) design, where threads share the complete table space. In this work, we propose an extension to the table space data structures, which we named Private Answer Chaining (PAC), as way to support batched scheduling evaluation with the FS design. Batched scheduling is one of the most successful tabling scheduling strategies, known to be useful when a tabled logic program requires an eager propagation of answers and/or do not requires the complete set of answers to be found. Experimental results show that PAC is a good first approach, since with it the FS design remains quite competitive.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 12