Go to:
Logótipo
Você está em: Start > Publications > View > Towards multi-threaded local tabling using a common table space
Map of Premises
Principal
Publication

Towards multi-threaded local tabling using a common table space

Title
Towards multi-threaded local tabling using a common table space
Type
Article in International Scientific Journal
Year
2012
Authors
Miguel Areias
(Author)
Other
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Ricardo Rocha
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Journal
Vol. 12
Pages: 427-443
ISSN: 1471-0684
Scientific classification
FOS: Natural sciences > Computer and information sciences
Other information
Authenticus ID: P-002-876
Abstract (EN): Multi-threading is currently supported by several well-known Prolog systems providing a highly portable solution for applications that can benefit from concurrency. When multi-threading is combined with tabling, we can exploit the power of higher procedural control and declarative semantics. However, despite the availability of both threads and tabling in some Prolog systems, the implementation of these two features implies complex ties to each other and to the underlying engine. Until now, XSB was the only Prolog system combining multi-threading with tabling. In XSB, tables may be either private or shared between threads. While thread-private tables are easier to implement, shared tables have all the associated issues of locking, synchronization and potential deadlocks. In this paper, we propose an alternative view to XSB's approach. In our proposal, each thread views its tables as private but, at the engine level, we use a common table space where tables are shared among all threads. We present three designs for our common table space approach: No-Sharing (NS) (similar to XSB's private tables), Subgoal-Sharing (SS) and Full-Sharing (FS). The primary goal of this work was to reduce the memory usage for the table space but, our experimental results, using the YapTab tabling system with a local evaluation strategy, show that we can also achieve significant reductions on running time.
Language: English
Type (Professor's evaluation): Scientific
Contact: miguel-areias@dcc.fc.up.pt; ricroc@dcc.fc.up.pt
No. of pages: 17
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

On Applying Linear Tabling to Logic Programs (2010)
Thesis
MIGUEL AREIAS; Ricardo Rocha
Yet Another Lock-Free Atom Table Design for Scalable Symbol Management in Prolog (2024)
Article in International Scientific Journal
Moreno, P; Miguel Areias; Ricardo Rocha; Costa, VS
Table space designs for implicit and explicit concurrent tabled evaluation (2018)
Article in International Scientific Journal
Miguel Areias; Ricardo Rocha
On the implementation of memory reclamation methods in a lock-free hash trie design (2021)
Article in International Scientific Journal
Moreno, P; Miguel Areias; Ricardo Rocha

See all (30)

Of the same journal

Introduction to the 33rd international conference on logic programming special issue (2017)
Another Publication in an International Scientific Journal
Ricardo Rocha; Son, TC
Introduction to the 28th international conference on logic programming special issue (2012)
Another Publication in an International Scientific Journal
AGOSTINO DOVIER; VÃTOR SANTOS COSTA
Threads and or-parallelism unified (2010)
Article in International Scientific Journal
Ines Dutra; Ricardo Rocha
The YAP Prolog system (2012)
Article in International Scientific Journal
Vitor Santos Costa; Ricardo Rocha; Luis Damas
Tabling, Rational Terms, and Coinduction Finally Together! (2014)
Article in International Scientific Journal
Theofrastos Mantadelis; Ricardo Rocha; Paulo Moura

See all (21)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-15 at 22:34:38 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book