A wait-free algorithm for optimistic programming: HOPE realized

Author

Cowan, Crispin ; Lutfiyya, H.L.

Author_Institution

Dept. of Comput. Sci. & Eng., Oregon Graduate Inst., Portland, OR, USA

fYear

1996

fDate

27-30 May 1996

Firstpage

484

Lastpage

493

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

Keywords

concurrency control; parallel programming; programming environments; HOPE; communications latency; concurrency; distributed environment; distributed program performance; distributed systems; optimistic programming; optimistic techniques; wait-free algorithm; Computer science; Concurrent computing; Delay; Distributed computing; Parallel processing; Power engineering and energy; Power engineering computing; Power system modeling; Prototypes; Writing;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1996., Proceedings of the 16th International Conference on

Print_ISBN

0-8186-7399-0

Type

conf

DOI

10.1109/ICDCS.1996.507997

Filename

507997