Technical Report no. 2003-06 Fast, Reactive and Lock-freeMulti-word Compare-and-swap Algorithms
BibTeX
@MISC{Ha-hoai_technicalreport,
author = {Phuong Ha-hoai},
title = {Technical Report no. 2003-06 Fast, Reactive and Lock-freeMulti-word Compare-and-swap Algorithms},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract Shared memory multiprocessors typically provide a set of single-word compare-and-swap-like hardware primitives tosupport synchronization. Although these are conceptually powerful enough to support higher-level synchronization, from the programmer's point of view they are not as useful as their generalizations to the multi-word objects.This paper presents two fast and reactive lock-free multi-word compare-and-swap algorithms. The algorithms dynamically measure the level of contention and automatically react to guarantee good performance. Experiments on a SGI-Origin2000multiprocessor show that our algorithms react fast according to the contention variations and perform two to nine times faster than the best-known alternatives.
