The Colored Ticket Algorithm.

Abstract

Upper and lower bounds are proved for shared space requirements for solution of a problem involving resource allocation among asynchronous processes. The problem is to allocate some number k > or = 1, of resources, in an environment in which processes can fail by stopping without warning. Allocation is to be as FIFO as possible, subject to variations imposed by the possibility of failures. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1983
Accession Number
ADA148696

Entities

People

  • A. Borodin
  • John A. Burns
  • M. Fischer
  • N. A. Lynch

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Asynchronous Systems
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Construction
  • Contracts
  • Fault Tolerance
  • Information Processing
  • Information Systems
  • Language
  • Massachusetts
  • Military Research
  • Programming Languages
  • Simulations
  • Technical Information Centers

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.
  • Operations Research

Technology Areas

  • Space