Wakeup problem

Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We study a new problem, the wakeup problem, that seems to be very 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.

Original languageEnglish
Title of host publicationProc 22nd Annu ACM Symp Theory Comput
PublisherPubl by ACM
Number of pages11
ISBN (Print)0897913612, 9780897913614
StatePublished - 1990
Externally publishedYes
EventProceedings of the 22nd Annual ACM Symposium on Theory of Computing - Baltimore, MD, USA
Duration: 14 May 199016 May 1990

Publication series

NameProc 22nd Annu ACM Symp Theory Comput


ConferenceProceedings of the 22nd Annual ACM Symposium on Theory of Computing
CityBaltimore, MD, USA


Dive into the research topics of 'Wakeup problem'. Together they form a unique fingerprint.

Cite this