The Wakeup Problem

DOI10.1137/S0097539793254959MaRDI QIDQ5691299zbMATH OpenOpenAlexFDO

Authors Michael Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld

Publication date 9 June 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539793254959

zbMATH Keywords

distributed computingshared memorywakeup problem

Mathematics Subject Classification ID

Computer system organization (68M99) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The wakeup problem in synchronous broadcast systems (extended abstract)
• The wakeup problem in synchronous broadcast systems
• A 3-valued wakeup protocol
• The wake-up problem in multi-hop radio networks

Cited in

(7)

• Available stabilizing heaps
• Computing in totally anonymous asynchronous shared memory systems
• Consensus in Networks of Multiagents with Stochastically Switching Topologies and Time-Varying Delays
• Lower bounds for the broadcast problem in mobile radio networks
• Hundreds of impossibility results for distributed computing
• The wakeup problem in synchronous broadcast systems (extended abstract)
• A 3-valued wakeup protocol

This page was built for publication: The Wakeup Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5691299)