The Wakeup Problem

DOI10.1137/S0097539793254959zbMath0864.68008OpenAlexW2056176510MaRDI QIDQ5691299

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

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

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

Related Items

Lower bounds for the broadcast problem in mobile radio networks ⋮ Hundreds of impossibility results for distributed computing ⋮ Consensus in Networks of Multiagents with Stochastically Switching Topologies and Time-Varying Delays ⋮ Computing in totally anonymous asynchronous shared memory systems ⋮ Available stabilizing heaps

This page was built for publication: The Wakeup Problem