English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A critical component in the implementation of a concurrent tabling system isthe design of the table space. One of the most successful proposals forrepresenting tables is based on a two-level trie data structure, where one trielevel stores the tabled subgoal calls and the other stores the computedanswers. In this work, we present a simple and efficient lock-free design whereboth levels of the tries can be shared among threads in a concurrentenvironment. To implement lock-freedom we took advantage of the CAS atomicinstruction that nowadays can be widely found on many common architectures. CASreduces the granularity of the synchronization when threads access concurrentareas, but still suffers from low-level problems such as false sharing or cachememory side-effects. In order to be as effective as possible in the concurrentsearch and insert operations over the table space data structures, we based ourdesign on a hash trie data structure in such a way that it minimizes potentiallow-level synchronization problems by dispersing as much as possible theconcurrent areas. Experimental results in the Yap Prolog system show that ournew lock-free hash trie design can effectively reduce the execution time andscale better than previous designs.

A Simple and Efficient Lock-Free Hash Trie Design for Concurrent Tabling