The wakeup problem

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

doi:10.1137/S0097539793254959

The wakeup problem

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

Computer Science discipline

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	1332-1357
Number of pages	26
Journal	SIAM Journal on Computing
Volume	25
Issue number	6
DOIs	https://doi.org/10.1137/S0097539793254959
State	Published - Dec 1996

Keywords

Algorithms
Concurrency
Fault tolerance
Shared memory

Access to Document

10.1137/S0097539793254959

Cite this

@article{6cff0556ae3440a6adce0696bd202367,

title = "The wakeup problem",

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.",

keywords = "Algorithms, Concurrency, Fault tolerance, Shared memory",

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

year = "1996",

month = dec,

doi = "10.1137/S0097539793254959",

language = "אנגלית",

volume = "25",

pages = "1332--1357",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "6",

}

TY - JOUR

T1 - The wakeup problem

AU - Fischer, Michael J.

AU - Moran, Shlomo

AU - Rudich, Steven

AU - Taubenfeld, Gadi

PY - 1996/12

Y1 - 1996/12

N2 - 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.

AB - 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.

KW - Algorithms

KW - Concurrency

KW - Fault tolerance

KW - Shared memory

UR - http://www.scopus.com/inward/record.url?scp=0012624759&partnerID=8YFLogxK

U2 - 10.1137/S0097539793254959

DO - 10.1137/S0097539793254959

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0012624759

SN - 0097-5397

VL - 25

SP - 1332

EP - 1357

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 6

ER -

The wakeup problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this