The Complexity of Distributed Concurrency Control

DOI10.1137/0214004zbMATH Open0564.68066OpenAlexW2150715348MaRDI QIDQ3678697FDOQ3678697

Authors Paris C. Kanellakis, Christos Papadimitriou 

Publication date 1985

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

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

zbMATH Keywords

distributed computingcombinatorial gamedistributed databasesPSPACE- complete

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Theory of operating systems (68N25)

Recommendations

• The Complexity of Reliable Concurrency Control
• scientific article; zbMATH DE number 3870604
• Complexity of distributed commit protocols
• Distribution and locality of concurrent systems
• The complexity of reachability in distributed communicating processes
• scientific article; zbMATH DE number 192866

Cited in

(12)

• The Complexity of Reliable Concurrency Control
• On the price of concurrency in group ratcheting protocols
• scientific article; zbMATH DE number 4033153 (Why is no real title available?)
• Predicate control: synchronization in distributed computations with look-ahead.
• Is distributed locking harder?
• A comparative study of some concurrency control algorithms for cluster-based communication networks
• Continuation Complexity: A Callback Hell for Distributed Systems
• Time-communication impossibility results for distributed transactional memory
• A note on the transaction backout problem
• Distributed Computing
• scientific article; zbMATH DE number 1756660 (Why is no real title available?)
• scientific article; zbMATH DE number 4076681 (Why is no real title available?)

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

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