## The wakeup problem (1996)

Venue: | SIAM Journal on Computing |

Citations: | 24 - 5 self |

### BibTeX

@ARTICLE{Fischer96thewakeup,

author = {Michael J. Fischer and Shlomo Moran and Steven Rudich and Gadi Taubenfeld},

title = {The wakeup problem},

journal = {SIAM Journal on Computing},

year = {1996},

volume = {25},

pages = {106--116}

}

### Years of Citing Articles

### OpenURL

### Abstract

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.