Multi-granularity locking for nested transactions: A proof using a possibilities mapping

DOI10.1007/S002360050038zbMATH Open0837.68019OpenAlexW2091024916MaRDI QIDQ1901697FDOQ1901697

Authors: Yanyan Li 

Publication date: 19 November 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050038

Recommendations

• Commutativity-based locking for nested transactions
• A model for concurrency in nested transactions systems
• Hybrid atomicity for nested transactions
• Introduction to the theory of nested transactions
• On the power of safe locking

zbMATH Keywords

nested transactionscorrectness algorithmmulti-granularity locking algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Parallel algorithms in computer science (68W10)

Cites Work

• Commutativity-based locking for nested transactions
• On the correctness of orphan management algorithms

Cited In (2)

• Nested, but separate: isolating unrelated critical sections in real-time nested locking
• Implementation of automated fine-granularity locking in a persistent programming language

This page was built for publication: Multi-granularity locking for nested transactions: A proof using a possibilities mapping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901697)