Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- invited-talkJuly 2016
Concurrent Data Structures
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 151–153https://doi.org/10.1145/2933057.2933123Data structures are an important component of efficient and well-structured programs. In shared memory distributed computing, correct data structures are difficult to construct because concurrent accesses by different processes can conflict with one ...
- research-articleJuly 2016
A Faster Distributed Radio Broadcast Primitive: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 361–370https://doi.org/10.1145/2933057.2933121We present a faster distributed broadcasting primitive for the classical radio network model.
The most basic distributed radio network broadcasting primitive - called Decay - dates back to a PODC'87 result of Bar-Yehuda, Goldreich, and Itai. In any ...
- research-articleJuly 2016
Unbeatable Set Consensus via Topological and Combinatorial Reasoning
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 107–116https://doi.org/10.1145/2933057.2933120The set consensus problem has played an important role in the study of distributed systems for over two decades. Indeed, the search for lower bounds and impossibility results for this problem spawned the topological approach to distributed computing, ...
- research-articleJuly 2016
The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 461–467https://doi.org/10.1145/2933057.2933119Information propagation on graphs is a fundamental topic in distributed computing. One of the simplest models of information propagation is the push protocol in which at each round each agent independently pushes the current knowledge to a random ...
- research-articleJuly 2016
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 305–313https://doi.org/10.1145/2933057.2933118The focus of this paper is to understand storage costs of emulating an atomic shared memory over an asynchronous, distributed message passing system. Previous literature has developed several shared memory emulation algorithms based on replication and ...
-
- research-articleJuly 2016
Deterministic Objects: Life Beyond Consensus
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 97–106https://doi.org/10.1145/2933057.2933116For all integers m ≥ 2, we construct an infinite sequence of deterministic objects of consensus number m with strictly increasing computational power. In particular, this refutes the Common2 Conjecture, which claimed that every deterministic object of ...
- research-articleJuly 2016
An Algorithm for Replicated Objects with Efficient Reads
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 325–334https://doi.org/10.1145/2933057.2933111The problem. We consider the problem of implementing a consistent replicated object in a partially synchronous message passing distributed system susceptible to process and communication failures. The object is a generic shared resource, such as a data ...
- research-articleJuly 2016
Contention Resolution on Multiple Channels with Collision Detection
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 175–184https://doi.org/10.1145/2933057.2933110In this paper, we consider the classical contention resolution problem in which an unknown subset of n possible nodes are activated and connected to a shared channel. The problem is solved in the first round that an active node transmits alone (thus ...
- research-articleJuly 2016
Distributed Algorithms for Planar Networks I: Planar Embedding
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 29–38https://doi.org/10.1145/2933057.2933109This paper presents the first (non-trivial) distributed planar embedding algorithm. We consider this a crucial first step in a broader program to design efficient distributed algorithms for planar networks. We work in the standard distributed model in ...
- research-articleJuly 2016
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 279–288https://doi.org/10.1145/2933057.2933107We consider programmable matter as a collection of simple computational elements (or particles) with limited (constant-size) memory that self-organize to solve system-wide problems of movement, configuration, and coordination. Here, we focus on the ...
- research-articleJuly 2016
Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 425–434https://doi.org/10.1145/2933057.2933105This paper addresses the problem of distributed multi-agent optimization in which each agent i has a local cost function hi(x), and the goal is to optimize a global cost function that aggregates the local cost functions. Such optimization problems are ...
- research-articleJuly 2016
Space Bounds for Reliable Storage: Fundamental Limits of Coding
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 249–258https://doi.org/10.1145/2933057.2933104We study the inherent space requirements of reliable storage algorithms in asynchronous distributed systems. A number of recent works have used codes in order to achieve a better storage cost than the well-known replication approach. However, a closer ...
- research-articleJuly 2016
MST in Log-Star Rounds of Congested Clique
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 19–28https://doi.org/10.1145/2933057.2933103We present a randomized algorithm that computes a Minimum Spanning Tree (MST) in O(log* n) rounds, with high probability, in the Congested Clique model of distributed computing. In this model, the input is a graph on n nodes, initially each node knows ...
- research-articleJuly 2016
How Proofs are Prepared at Camelot: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 391–400https://doi.org/10.1145/2933057.2933101We study a design framework for robust, independently verifiable, and workload-balanced distributed algorithms working on a common input. The framework builds on recent noninteractive Merlin--Arthur proofs of batch evaluation of Williams~[31st IEEE ...
- research-articleJuly 2016
Optimal Mobile Byzantine Fault Tolerant Distributed Storage: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 269–278https://doi.org/10.1145/2933057.2933100We present an optimal emulation of a server based regular read/write storage in a synchronous round-free message-passing system that is subject to mobile Byzantine failures and prove that the problem is impossible to solve in asynchronous settings. In a ...
- research-articleJuly 2016
On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 235–244https://doi.org/10.1145/2933057.2933098Given a distributed network represented by a weighted undirected graph G=(V,E) on n vertices, and a parameter k, we devise a distributed algorithm that computes a routing scheme in O(n1/2+1/k+D)⋅ no(1) rounds, where D is the hop-diameter of the network. ...
- research-articleJuly 2016
A Polylogarithmic Gossip Algorithm for Plurality Consensus
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 117–126https://doi.org/10.1145/2933057.2933097Consider n anonymous nodes each initially supporting an opinion in {1, 2, …, k} and suppose that they should all learn the opinion with the largest support. Per round, each node contacts a random other node and exchanges B bits with it, where typically ...
- research-articleJuly 2016
Distributed Strong Diameter Network Decomposition: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 211–216https://doi.org/10.1145/2933057.2933094For a pair of positive parameters D,Χ, a partition P of the vertex set V of an n-vertex graph G = (V,E) into disjoint clusters of diameter at most D each is called a (D,Χ) network decomposition}, if the supergraph G(P), obtained by contracting each of ...
- research-articleJuly 2016
Uniform Deployment of Mobile Agents in Asynchronous Rings
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 415–424https://doi.org/10.1145/2933057.2933093In this paper, we consider the uniform deployment problem of mobile agents in asynchronous unidirectional rings, which requires the agents to uniformly spread in the ring. The uniform deployment problem is striking contrast to the rendezvous problem ...
- research-articleJuly 2016
Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 83–92https://doi.org/10.1145/2933057.2933092A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modelled as static balls into bins processes, where m balls (tasks) are to be ...