On Extending a Linear Tabling Framework to Support Batched Scheduling
Miguel Areias and Ricardo Rocha
June 2012
Abstract
Tabled evaluation is a recognized and powerful technique that
overcomes some limitations of traditional Prolog systems in dealing
with recursion and redundant sub-computations. During tabled
execution, several decisions have to be made. These are determined by
the scheduling strategy. Whereas a strategy can achieve very good
performance for certain applications, for others it might add
overheads and even lead to unacceptable inefficiency. The two most
successful tabling scheduling strategies are local scheduling and
batched scheduling. In previous work, we have developed a framework,
on top of the Yap system, that supports the combination of different
linear tabling strategies for local scheduling. In this work, we
propose the extension of our framework, to support batched
scheduling. In particular, we are interested in the two most
successful linear tabling strategies, the DRA and DRE strategies. To
the best of our knowledge, no single tabling Prolog system supports
both strategies simultaneously for batched scheduling.
Bibtex
@InProceedings{areias-slate12,
author = {M. Areias and R. Rocha},
title = {{On Extending a Linear Tabling Framework to Support Batched Scheduling}},
booktitle = {Proceedings of the Symposium on Languages, Applications and Technologies (SLATE 2012)},
pages = {9--24},
editor = {A. Simões and R. Queirós and D. Cruz},
month = {June},
year = {2012},
address = {Braga, Portugal},
}
Download Paper
PDF file
OASIcs OpenAccess Series in Informatics