Accession Number : ADA311249
Title : A Wait-free Algorithm for Optimistic Programming: HOPE Realized,
Corporate Author : OREGON GRADUATE INST BEAVERTON
Personal Author(s) : Cowan, Crispin ; Lutfiyya, Hanan L.
PDF Url : ADA311249
Report Date : 1995
Pagination or Media Count : 10
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.
Descriptors : *OPTIMIZATION, *DISTRIBUTED DATA PROCESSING, *PARALLEL PROCESSING, *CONCURRENT ENGINEERING, ALGORITHMS, DATA MANAGEMENT, COMPUTER COMMUNICATIONS, SEMANTICS, INPUT OUTPUT PROCESSING, SYSTEMS ANALYSIS, COMPUTER NETWORKS, MESSAGE PROCESSING, EXECUTIVE ROUTINES, CONTROL SEQUENCES.
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE