International Journal of Parallel Programming

, Volume 44, Issue 3, pp 386–406

A Lock-Free Hash Trie Design for Concurrent Tabled Logic Programs

Article

DOI: 10.1007/s10766-014-0346-1

Cite this article as:
Areias, M. & Rocha, R. Int J Parallel Prog (2016) 44: 386. doi:10.1007/s10766-014-0346-1
  • 101 Downloads

Abstract

Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog systems in dealing with recursion and redundant sub-computations. A critical component in the design of a concurrent tabling system is the implementation of the table space. One of the most successful proposals for representing tables is based on a two-level trie data structure, where one trie level stores the tabled subgoal calls and the other stores the computed answers. In previous work, we have presented a sophisticated lock-free design where both levels of the tries where shared among threads in a concurrent environment. To implement lock-freedom we used the CAS atomic instruction that nowadays is widely found on many common architectures. CAS reduces the granularity of the synchronization when threads access concurrent areas, but still suffers from problems such as false sharing or cache memory effects. In this work, we present a simpler and efficient lock-free design based on hash tries that minimizes these problems by dispersing the concurrent areas as much as possible. Experimental results in the Yap Prolog system show that our new lock-free design can effectively reduce the execution time and scales better than previous designs.

Keywords

Tabling Concurrency Hash tries Lock-freedom  Performance 

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.CRACS & INESC TEC, Faculty of SciencesUniversity of PortoPortoPortugal