Introduction to the theory of nested transactions

DOI10.1016/0304-3975(86)90014-9zbMath0671.68043OpenAlexW2114811697MaRDI QIDQ1119399

Michael Merritt, Nancy A. Lynch

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90014-9

zbMATH Keywords

concurrencynested transactionconcurrent scheduleslocking algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Information storage and retrieval of data (68P20)

Related Items (6)

Verifying atomic data types ⋮ Compact and localized distributed data structures ⋮ A rule based knowledge transaction model for mobile environments ⋮ Hierarchical deadlock detection for nested transactions ⋮ Modularity for teams of I/O automata ⋮ Virtual partition algorithm in a nested transaction environment and its correctness

Cites Work

• Unnamed Item
• A characterization of database graphs admitting a simple locking protocol
• A calculus of communicating systems
• Operating systems. An advanced course
• Guardians and Actions: Linguistic Support for Robust, Distributed Programs
• A model for concurrency in nested transactions systems
• The notions of consistency and predicate locks in a database system

This page was built for publication: Introduction to the theory of nested transactions