A Framework for Consistency Algorithms

07/21/2020
by   Peter Chini, et al.
0

We present a framework that provides deterministic consistency algorithms for given memory models. Such an algorithm checks whether the executions of a shared-memory concurrent program are consistent under the axioms defined by a model. For memory models like SC and TSO, checking consistency is NP-complete. Our framework shows, that despite the hardness, fast deterministic consistency algorithms can be obtained by employing tools from fine-grained complexity. The framework is based on a universal consistency problem which can be instantiated by different memory models. We construct an algorithm for the problem running in time O*(2^k), where k is the number of write accesses in the execution that is checked for consistency. Each instance of the framework then admits an O*(2^k)-time consistency algorithm. By applying the framework, we obtain corresponding consistency algorithms for SC, TSO, PSO, and RMO. Moreover, we show that the obtained algorithms for SC, TSO, and PSO are optimal in the fine-grained sense: there is no consistency algorithm for these running in time 2^o(k) unless the exponential time hypothesis fails.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2023

Optimal Reads-From Consistency Checking for C11-Style Memory Models

Over the years, several memory models have been proposed to capture the ...
research
07/22/2023

As if Time Had Stopped – Checking Memory Dumps for Quasi-Instantaneous Consistency

Memory dumps that are acquired while the system is running often contain...
research
08/13/2019

On the Complexity of Checking Transactional Consistency

Transactions simplify concurrent programming by enabling computations on...
research
08/12/2021

On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem

Consider positive integral solutions x ∈ℤ^n+1 to the equation a_0 x_0 + ...
research
10/13/2022

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width

The generic homomorphism problem, which asks whether an input graph G ad...
research
09/26/2019

Complexity of Liveness in Parameterized Systems

We investigate the fine-grained complexity of liveness verification for ...
research
12/14/2021

HET: Scaling out Huge Embedding Model Training via Cache-enabled Distributed Framework

Embedding models have been an effective learning paradigm for high-dimen...

Please sign up or login with your details

Forgot password? Click here to reset