A Wait-free Algorithm for Optimistic Programming: HOPE Realized,

Abstract

Optimism is a powerful technique for avoiding latency by increasing concurrency. Optimistically assuming the results of one computation allows other computations to execute in parallel, even when they depend on the assumed result. Optimistic techniques can particularly benefit distributed systems because of the critical impact of communications latency. This paper reviews HOPE: our model of optimistic programming, and describes how optimism can enhance distributed program performance by avoiding remote communications delay. We then present the wait-free algorithm used to implement HOPE in a distributed environment.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1995
Accession Number
ADA311249

Entities

People

  • Crispin Cowan
  • Hanan L. Lutfiyya

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Control Systems
  • Engineering
  • Fault Tolerance
  • Intervals
  • Message Processing
  • Models
  • Multithreading
  • Prototypes
  • Semantics
  • Sequences
  • Simulations

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.
  • Systems Analysis and Design