A wait-free algorithm for optimistic programming: HOPE realized

摘要

Optimism is a powerful technique for avoiding latency bynincreasing concurrency. Optimistically assuming the results of onencomputation allows other computations to execute in parallel, even whennthey depend on the assumed result. Optimistic techniques cannparticularly benefit distributed systems because of the critical impactnof communications latency. This paper reviews HOPE: our model ofnoptimistic programming, and describes how optimism can enhancendistributed program performance by avoiding remote communications delay.nWe then present the wait-free algorithm used to implement HOPE in andistributed environment