Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > On scaling dynamic programming problems with a multithreaded tabling, Prolog system
Publication

Publications

On scaling dynamic programming problems with a multithreaded tabling, Prolog system

Title
On scaling dynamic programming problems with a multithreaded tabling, Prolog system
Type
Article in International Scientific Journal
Year
2017
Authors
Miguel Areias
(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
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. 125
Pages: 417-426
ISSN: 0164-1212
Publisher: Elsevier
Other information
Authenticus ID: P-00M-E2K
Abstract (EN): Tabling is a powerful implementation technique that improves the declarativeness and expressiveness of traditional Prolog systems in dealing with recursion and redundant computations. It can be viewed as a natural tool to implement dynamic programming problems, where a general recursive strategy divides a problem in simple sub-problems that are often the same. 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. However, at the engine level, such combination for dynamic programming problems is very difficult to exploit in order to achieve execution scalability as we increase the number of running threads. In this work, we focus on two well-known dynamic programming problems, the Knapsack and the Longest Common Subsequence problems, and we discuss how we were able to scale their execution by using the multithreaded tabling engine of the Yap Prolog system. To the best of our knowledge, this is the first work showing a Prolog system to be able to scale the execution of multithreaded dynamic programming problems. Our experiments also show that our system can achieve comparable or even better speedup results than other parallel implementations of the same problems.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 10
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
Towards multi-threaded local tabling using a common table space (2012)
Article in International Scientific Journal
Miguel Areias; Ricardo Rocha
Table space designs for implicit and explicit concurrent tabled evaluation (2018)
Article in International Scientific Journal
Miguel Areias; Ricardo Rocha

See all (30)

Of the same journal

WASMICO: Micro-containers in microcontrollers with WebAssembly (2024)
Article in International Scientific Journal
Ribeiro, E; André Restivo; Hugo Sereno Ferreira; Dias, JP
SPELLing out energy leaks: Aiding developers locate energy inefficient code (2020)
Article in International Scientific Journal
Pereira, R; Carcao, T; Couto, M; Cunha, J; Joao Paulo Fernandes; Saraiva, J
Spectrum-based feature localization for families of systems? (2023)
Article in International Scientific Journal
Michelon, GK; Martinez, J; Sotto Mayor, B; Arrieta, A; Assuncao, WKG; Rui Abreu; Egyed, A
Simultaneous debugging of software faults (2011)
Article in International Scientific Journal
Rui Abreu; Peter Zoeteweij; Arjan J C van Gemund
On Haskell and energy efficiency (2019)
Article in International Scientific Journal
Lima, LG; Soares Neto, F; Lieuthier, P; Castor, F; Melfe, G; Joao Paulo Fernandes

See all (10)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-08 at 12:29:42 | Privacy Policy | Personal Data Protection Policy | Whistleblowing