Combinatorica
Tolerating a linear number of faults in networks of bounded degree
Information and Computation
Time-optimal message-efficient work performance in the presence of faults
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing
The do-all problem in broadcast networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Randomization Helps to Perform Tasks on Processors Prone to Failures
Proceedings of the 13th International Symposium on Distributed Computing
The Complexity of Synchronous Iterative Do-All with Crashes
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Scalable Secure Storage when Half the System Is Faulty
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Resolving message complexity of Byzantine Agreement and beyond
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Performing tasks on synchronous restartable message-passing processors
Distributed Computing
Efficient parallel algorithms can be made robust
Distributed Computing
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
distributed cooperation and adversity: complexity trade-offs
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Performing work with asynchronous processors: message-delay-sensitive bounds
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Performing work with asynchronous processors: message-delay-sensitive bounds
Information and Computation
Efficient gossip and robust distributed computation
Theoretical Computer Science
The Do-All problem with Byzantine processor failures
Theoretical Computer Science - Foundations of software science and computation structures
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
On the complexity of asynchronous gossip
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Performing work with asynchronous processors: Message-delay-sensitive bounds
Information and Computation
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We consider the Do-All problem: p failure-prone processors perform t similar and independent tasks. We assume that processors are synchronous, communicate by message passing, and are subject to crashes determined by an adaptive adversary restricted only by the upper bound f on the number of crashes. The performance of algorithms in this setting is normally measured in terms of work (total available processor steps) and communication (total number of point-to-point messages) complexity. We consider work and communication as comparable resources and we develop algorithms that have efficient effort defined as work + communication. We present a p-processor, t-task algorithm that has effort O(t + p1.77), against the unbounded adversary (f ). This is the first algorithm that achieves subquadratic in p effort efficiency for unbounded adversary, or even for linearly-bounded adversary that crashes up to a constant fraction of the processors. We present another algorithm that has work O(t + p log2 p) against f-bounded adversaries such that p-f = 驴(pb) for a constant b, 0 b O(t + p log2 p) against a linearly-bounded adversary; this result is close to lower bound 驴(t + p log p/ log log p).