Javascript must be enabled to continue!
Linearizability on hardware weak memory models
View through CrossRef
Abstract
Linearizability is a widely accepted notion of correctness for concurrent objects. Recent research has investigated redefining linearizability for particular hardware weak memory models, in particular for TSO. In this paper, we provide an overview of this research and show that such redefinitions of linearizability are not required: under an interpretation of specification behaviour which abstracts from weak memory effects, the standard definition of linearizability is sound and complete on
all
hardware weak memory models.We prove our result with respect to a definition of object refinement which takes a weak memory model as a parameter. The main consequence of our findings is that we can leverage the range of existing techniques and tools for standard linearizability when verifying concurrent objects running on hardware weak memory models.
Association for Computing Machinery (ACM)
Title: Linearizability on hardware weak memory models
Description:
Abstract
Linearizability is a widely accepted notion of correctness for concurrent objects.
Recent research has investigated redefining linearizability for particular hardware weak memory models, in particular for TSO.
In this paper, we provide an overview of this research and show that such redefinitions of linearizability are not required: under an interpretation of specification behaviour which abstracts from weak memory effects, the standard definition of linearizability is sound and complete on
all
hardware weak memory models.
We prove our result with respect to a definition of object refinement which takes a weak memory model as a parameter.
The main consequence of our findings is that we can leverage the range of existing techniques and tools for standard linearizability when verifying concurrent objects running on hardware weak memory models.
Related Results
Linearizability with Ownership Transfer
Linearizability with Ownership Transfer
Linearizability is a commonly accepted notion of correctness for libraries of
concurrent algorithms. Unfortunately, it assumes a complete isolation between a
library and its client...
Performance simulation methodologies for hardware/software co-designed processors
Performance simulation methodologies for hardware/software co-designed processors
Recently the community started looking into Hardware/Software (HW/SW) co-designed processors as potential solutions to move towards the less power consuming and the less complex de...
Virtualizable hardware/software design infrastructure for dynamically partially reconfigurable systems
Virtualizable hardware/software design infrastructure for dynamically partially reconfigurable systems
In most existing works, reconfigurable hardware modules are still managed as conventional hardware devices. Further, the software reconfiguration overhead incurred by loading corre...
Proving Linearizability of Concurrent Queues
Proving Linearizability of Concurrent Queues
<p>Linearizability is a commonly accepted correctness criterion for concurrent data structures. Concurrent queues are among the most fundamental concurrent data structures. I...
Proving Linearizability Using Linearizations of Delete Operations
Proving Linearizability Using Linearizations of Delete Operations
Abstract
Linearizability is a commonly accepted correctness criterion for concurrent data structures. Concurrent queues and stacks are among themost fundamental concurrent ...
Detection and estimation of weak pulse signal in chaotic background noise
Detection and estimation of weak pulse signal in chaotic background noise
As is well known, people has been suffering noise interference for a long time, and more and more researches show that a lot of weak signals such as pulse signal are embedded in th...
Intrinsic Evolvable Hardware Structures
Intrinsic Evolvable Hardware Structures
The main target of this chapter is to present the intrinsic evolvable hardware structures: concept, design and applications. The intrinsic evolvable hardware structures concept joi...
Singularity#1 and MFA II. Singularität Nr. 1 und MFA II.
Singularity#1 and MFA II. Singularität Nr. 1 und MFA II.
AbstractThe Dog-Ears formal system (Bheemaiah, n.d.) is extended with MFA II architecture for the definition of Taskoids, needing adaptable designs and additive printing. We presen...

