Sciweavers

Share
PODC
2015
ACM
3 years 2 months ago
Trading Fences with RMRs and Separating Memory Models
Hagit Attiya, Danny Hendler, Philipp Woelfel
PODC
2015
ACM
3 years 2 months ago
Brief Announcement: Fault-tolerant Broadcast in Anonymous Distributed Systems with Fair Lossy Communication Channels
Fault-tolerant broadcast is a fundamental service in distributed systems, by which processes can communicate with each other consistently and reliably. It has two main forms: Reli...
Jian Tang, Mikel Larrea, Sergio Arévalo, Er...
PODC
2015
ACM
3 years 2 months ago
Adaptively Secure Computation with Partial Erasures
Adaptive security is a strong corruption model that captures “hacking” attacks where an external attacker breaks into parties’ machines in the midst of a protocol execution....
Carmit Hazay, Yehuda Lindell, Arpita Patra
PODC
2015
ACM
3 years 2 months ago
Distributed House-Hunting in Ant Colonies
We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony’s nest becomes unsuitable due to size constraints or ...
Mohsen Ghaffari, Cameron Musco, Tsvetomira Radeva,...
PODC
2015
ACM
3 years 2 months ago
Safety-Liveness Exclusion in Distributed Computing
The history of distributed computing is full of trade-offs between safety and liveness. For instance, one of the most celebrated results in the field, namely the impossibility of...
Victor Bushkov, Rachid Guerraoui
PODC
2015
ACM
3 years 2 months ago
Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way
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...
Trevor Alexander Brown
PODC
2015
ACM
3 years 2 months ago
The Weakest Failure Detector for Eventual Consistency
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...
Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Fra...
PODC
2015
ACM
3 years 2 months ago
Fault-Tolerant Consensus in Directed Graphs
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...
Lewis Tseng, Nitin H. Vaidya
PODC
2015
ACM
3 years 2 months ago
Near-Optimal Scheduling of Distributed Algorithms
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...
Mohsen Ghaffari
books