The Wakeup Problem

Autor:	Shlomo Moran, Steven Rudich, Gadi Taubenfeld, Michael J. Fischer
Rok vydání:	1996
Předmět:	Leader election Mathematical optimization Theoretical computer science General Computer Science Computer science Real systems Computation General Mathematics Distributed computing Concurrency Fault tolerance Work (electrical) Consensus Shared memory Computational problem
Zdroj:	SIAM Journal on Computing. 25:1332-1357
ISSN:	1095-7111 0097-5397
DOI:	10.1137/s0097539793254959
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0d04e104178d5fb94b32e8424274736 https://doi.org/10.1137/s0097539793254959 Zobrazit plný text záznamu