Supercomputing out of recycled garbage: preliminary experience with Piranha
ICS '92 Proceedings of the 6th international conference on Supercomputing
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 “worm” programs—early experience with a distributed computation
Communications of the ACM
The do-all problem in broadcast networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Fault-Tolerant Parallel Computation
Fault-Tolerant Parallel Computation
The Mobile Communications Handbook
The Mobile Communications Handbook
Randomization Helps to Perform Tasks on Processors Prone to Failures
Proceedings of the 13th International Symposium on Distributed Computing
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
Bounding Work and Communication in Robust Cooperative Computation
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
The complexity of synchronous iterative Do-All with crashes
Distributed Computing
Secure communication over radio channels
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A robust randomized algorithm to perform independent tasks
Journal of Discrete Algorithms
Of malicious motes and suspicious sensors
Theoretical Computer Science
Trusted computing for fault-prone wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
In the DO-ALL problem, a set of t tasks must be performed by using a synchronous network of p processors. Processors may fail by permanent crashing. We investigate the time and the work complexity of F-reliable protocols for the DO-ALL problem on 1-hop wireless networks without collision detection. An F-reliable protocol is a protocol that guarantees the execution of all tasks if at most F p faults happen during its execution. Previous results for this model are known only for the case F = p - 1.We obtain the following tight bounds. - The completion time of F-reliable protocols on 1-hop wireless networks without collision detection is &Theta(t/p - F + min {tF/p, F + 驴t}). - The work complexity of F-reliable protocols on 1-hop wireless networks without collision detection is 驴(t + F 驴 min{t, F}). The two lower bounds hold even when the faults only happen at the very beginning of the protocol execution.