The Wakeup Problem

Abstract

We study a new problem, the wakeup problem that seems to be very fundamental in distributed computating. We present efficient solutions to the problem, and show how these solution 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1990
Accession Number
ADA220534

Entities

People

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

Organizations

  • Yale University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Computational Science
  • Computations
  • Computer Networks
  • Computer Programming
  • Computer Science
  • Computers
  • Distributed Computing
  • Elections
  • Inequalities
  • Information Processing
  • Language
  • Load Monitoring
  • Monitoring
  • Programming Languages
  • Reasoning
  • Sequences
  • Terminals

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Systems Analysis and Design