111
Voted
PODC
2015
ACM
9 years 11 months ago
2015
ACM
Memory reclamation for sequential or lock-based data structures is typically easy. However, memory reclamation for lock-free data structures is a significant challenge. Automatic...
127
click to vote
PODC
2015
ACM
9 years 11 months ago
2015
ACM
In its classical form, a consistent replicated service requires all replicas to witness the same evolution of the service state. Assuming a message-passing environment with a majo...
127
Voted
PODC
2015
ACM
9 years 11 months ago
2015
ACM
Consider a point-to-point network in which nodes are connected by directed links. This paper proves tight necessary and sufficient conditions on the underlying communication graph...
109
Voted
PODC
2015
ACM
9 years 11 months ago
2015
ACM
This paper studies the question of how to run many distributed algorithms, solving independent problems, together as fast as possible. Suppose that we want to run distributed algo...
105
Voted
PODC
2015
ACM
9 years 11 months ago
2015
ACM