The wakeup problem

We study a new problem, the wakeup problem, that seems to be fundamental in distributed computing. We present ecient 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.

[1]  Yehuda Afek,et al.  Time and message bounds for election in synchronous and asynchronous complete networks , 1985, PODC '85.

[2]  Neil Immerman,et al.  Foundations of Knowledge for Distributed Systems , 1986, TARK.

[3]  Karl R. Abrahamson.  On achieving consensus using a shared memory , 1988, PODC '88.

[4]  Murray Sandor Mazer,et al.  A knowledge-theoretic account of negotiated commitment , 1989 .

[5]  Shmuel Katz,et al.  What processes know: Definitions and proof methods , 1986, PODC '86.

[6]  Vassos Hadzilacos,et al.  A knowledge-theoretic analysis of atomic commitment protocols , 1987, PODS '87.

[7]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[8]  Nancy A. Lynch,et al.  Electing a leader in a synchronous ring , 1987, JACM.

[9]  Nir Shavit,et al.  Toward a non-atomic era: l-exclusion as a test case , 1988, STOC '88.

[10]  Danny Dolev,et al.  An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.

[11]  Mohamed G. Gouda.  The Stabilizing Philosopher: Asymmetry by Memory and by Action , 1987 .

[12]  Jan K. Pachl,et al.  Uniform self-stabilizing rings , 1988, TOPL.

[13]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[14]  Shmuel Katz,et al.  Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version) , 1989, FSTTCS.

[15]  Gadi Taubenfeld.  On the Nonexistence of Resilient Consensus Protocols , 1991, Inf. Process. Lett..

[16]  Allan Borodin,et al.  Distributed FIFO allocation of identical resources using small shared space , 1985, TOPL.

[17]  Maurice Herlihy,et al.  Impossibility and universality results for wait-free synchronization , 1988, PODC '88.

[18]  Arvin Park,et al.  The Processor Identity Problem , 1990, Inf. Process. Lett..

[19]  Shmuel Zaks,et al.  Tight lower and upper bounds for some distributed algorithms for a complete network of processors , 1984, PODC '84.

[20]  Daniel Lehmann,et al.  Knowledge, common knowledge and related puzzles (Extended Summary) , 1984, PODC '84.

[21]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

[22]  Jayadev Misra,et al.  Phase Synchronization , 1991, Inf. Process. Lett..

[23]  Joseph Y. Halpern.  Reasoning About Knowledge: An Overview , 1986, TARK.

[24]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[25]  Joseph Y. Halpern,et al.  A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols , 1992, JACM.

[26]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[27]  ChangErnest,et al.  An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979 .

[28]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[29]  Nancy A. Lynch,et al.  A Technique for Decomposing Algorithms Which Use a Single Shared Variable , 1983, J. Comput. Syst. Sci..

[30]  Ronald Fagin,et al.  A model-theoretic analysis of knowledge , 1991, JACM.

[31]  Neil Immerman,et al.  Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse , 1987, Inf. Process. Lett..

[32]  Shay Kutten,et al.  A modular technique for the design of efficient distributed leader finding algorithms , 1990, TOPL.

[33]  Ralph Grishman,et al.  The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer , 1983, IEEE Transactions on Computers.

[34]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[35]  Michael J. Fischer,et al.  Reasoning about Uncertainty in Fault-tolerant Distributed Systems , 1988, FTRTFT.

[36]  Ronald Fagin,et al.  A formal model of knowledge, action, and communication in distributed systems: preliminary report , 1985, PODC '85.

[37]  Baruch Awerbuch,et al.  Atomic shared register access by asynchronous hardware , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[38]  Leslie Lamport,et al.  The mutual exclusion problem: partII—statement and solutions , 1986, JACM.

[39]  Doron Rotem,et al.  Lower Bounds for Distributed Maximum-Finding Algorithms , 1984, JACM.

[40]  Ramaswamy Ramanujam,et al.  Distributed Processes and the Logic of Knowledge , 1985, Logic of Programs.

[41]  Kevin P. McAuliffe,et al.  The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture , 1985, ICPP.

[42]  Gary L. Peterson,et al.  An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982, TOPL.

[43]  Amos Israeli,et al.  Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity , 1990, PODC.

[44]  Ruben Michel,et al.  A categorical approach to distributed systems expressibility and knowledge , 1989, PODC '89.

[45]  Yoram Moses,et al.  Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.

[46]  K. Mani Chandy,et al.  How processes learn , 1985, PODC '85.

[47]  Michael J. Fischer,et al.  The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.

[48]  Bard Bloom,et al.  Constructing two-writer atomic registers , 1987, PODC '87.

[49]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[50]  Mohamed G. Gouda,et al.  Token Systems that Self-Stabilize , 1989, IEEE Trans. Computers.

[51]  Mark Tuttle.  Knowledge and Distributed computation , 1989 .

[52]  Sandeep N. Bhatt,et al.  The fluent abstract machine , 1988 .

[53]  Daniel S. Hirschberg,et al.  Decentralized extrema-finding in circular configurations of processors , 1980, CACM.

[54]  Gadi Taubenfeld.  Leader Election in the Presence of n-1 Initial Failures , 1989, Inf. Process. Lett..

[55]  Nicholas Carriero,et al.  Linda in context , 1989, CACM.

[56]  H. S. M. Kruijer.  Self-Stabilization (in Spite of Distributed Control) in Tree-Structured Systems , 1979, Inf. Process. Lett..

[57]  Shmuel Katz,et al.  Self-stabilizing extensions for message-passing systems , 1990, PODC '90.