Pages that link to "Item:Q3678697"
From MaRDI portal
The following pages link to The Complexity of Distributed Concurrency Control (Q3678697):
Displaying 10 items.
- Is distributed locking harder? (Q1061510) (← links)
- A note on the transaction backout problem (Q1107967) (← links)
- Predicate control: synchronization in distributed computations with look-ahead. (Q1427456) (← links)
- Time-communication impossibility results for distributed transactional memory (Q2075626) (← links)
- On the price of concurrency in group ratcheting protocols (Q2119045) (← links)
- A comparative study of some concurrency control algorithms for cluster-based communication networks (Q2498259) (← links)
- The Complexity of Reliable Concurrency Control (Q3801060) (← links)
- (Q4535991) (← links)
- Distributed Computing (Q5395135) (← links)
- Continuation Complexity: A Callback Hell for Distributed Systems (Q5858633) (← links)