The wakeup problem

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

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)1332-1357
Number of pages26
JournalSIAM Journal on Computing
Issue number6
StatePublished - Dec 1996


  • Algorithms
  • Concurrency
  • Fault tolerance
  • Shared memory


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

Cite this