Strongly linearizable implementations, possibilities and impossibilities
From MaRDI portal
Recommendations
Cited in
(12)- Sub-core solutions of the problem of strong implementation
- Wait-freedom is harder than lock-freedom under strong linearizability
- Randomized consensus with regular registers
- Concurrent use of write-once memory
- Strongly Linearizable Implementations of Snapshots and Other Types
- Are shared objects composable under an oblivious adversary?
- Linearizable implementations do not suffice for randomized distributed computation
- scientific article; zbMATH DE number 7774258 (Why is no real title available?)
- Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects
- Preserving hyperproperties of programs using primitives with consensus number 2
- Strongly linearizable LL/SC from CAS
- Strong linearizability using primitives with consensus number 2
This page was built for publication: Strongly linearizable implementations, possibilities and impossibilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933816)