Commutativity-based concurrency control for abstract data types

DOI10.1109/12.9728zbMath0674.68016OpenAlexW2157092502MaRDI QIDQ3829058

William E. Weihl

Publication date: 1988

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.9728

zbMATH Keywords

lockingconcurrency controlstate machinerecoveryabstract data typesatomic transactionsdynamic atomicityintentions listlocal atomicitythe serial specificationundo logs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of operating systems (68N25)

Related Items (14)

On computing serial dependency relations ⋮ Improved time bounds for linearizable implementations of abstract data types ⋮ Unifying concurrency control and recovery of transactions with semantically rich operations ⋮ On the complexity of commutativity analysis ⋮ Replicated abstract data types: building blocks for collaborative applications ⋮ Synthesizing precise and useful commutativity conditions ⋮ Hybrid concurrency control for abstract data types ⋮ Hybrid atomicity for nested transactions ⋮ Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model ⋮ The impact of recovery on concurrency control ⋮ On correctness on nonserializable executions ⋮ Commutativity-based locking for nested transactions ⋮ In the Search for Optimal Concurrency ⋮ Virtual partition algorithm in a nested transaction environment and its correctness

This page was built for publication: Commutativity-based concurrency control for abstract data types