Computing with faulty shared objects
Journal of the ACM (JACM)
Constructing a Reliable Test&Set Bit
IEEE Transactions on Parallel and Distributed Systems
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A Stabilizing Deactivation/Reactivation Protocol
IEEE Transactions on Computers
SIAM Journal on Control and Optimization
Time and space lower bounds for implementations using k-CAS
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
We study a new problem---the wakeup problem---that seems to be fundamental in distributed computing. We present efficient solutions to the problem and show how these solutions can be used to solve the consensus problem, the leader-election problem, and other related problems. The main question we try to answer is ``How much memory is needed to solve the wakeup problem?'' We assume a model that captures important properties of real systems that have been largely ignored by previous work on cooperative problems.