The Complexity of Reliable Concurrency Control

DOI10.1137/0216036MaRDI QIDQ3801060zbMATH OpenOpenAlexFDO

Authors Mihalis Yannakakis, Christos Papadimitriou

Publication date 1987

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0216036

zbMATH Keywords

concurrency controlgamesPSPACE-completereliable scheduleserializability

Mathematics Subject Classification ID

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

Recommendations

• The Complexity of Distributed Concurrency Control
• On the complexity of concurrency control using semantic information
• Constraint-based concurrency and beyond
• The concurrency hierarchy, and algorithms for unbounded concurrency
• On the complexity of verifying concurrent transition systems
• On the complexity of verifying concurrent transition systems
• scientific article; zbMATH DE number 3915634
• scientific article; zbMATH DE number 3870604

Cited in

(8)

• Conceptual level concurrency control of relational update transactions
• On the complexity of concurrency control using semantic information
• The Complexity of Distributed Concurrency Control
• On serializability
• A theory of reliability in database systems
• Algorithmic aspects of multiversion concurrency control
• Continuation Complexity: A Callback Hell for Distributed Systems
• The impact of recovery on concurrency control

This page was built for publication: The Complexity of Reliable Concurrency Control

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