A Wait-free Algorithm for Optimistic Programming: HOPE Realized

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 be...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Cowan, Crispin, Lutfiyya, Hanan L
Format:	Report
Sprache:	eng
Schlagworte:	ALGORITHMS COMPUTER COMMUNICATIONS COMPUTER NETWORKS Computer Programming and Software Computer Systems CONCURRENT ENGINEERING CONTROL SEQUENCES DATA MANAGEMENT DISTRIBUTED DATA PROCESSING EXECUTIVE ROUTINES INPUT OUTPUT PROCESSING MESSAGE PROCESSING OPTIMIZATION PARALLEL PROCESSING SEMANTICS SYSTEMS ANALYSIS
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.