Improved implementations of binary universal operations.

We present an algorithm for implementing binary operations (of any type) from unary load-linked (LL) and store-conditional (SC) operations. The performance of the algorithm is evaluated according to its sensitivity, measuring the distance between operations in the graph induced by conflicts, which g...

Descripción completa

Detalles Bibliográficos
Publicado en:Journal of the ACM 48, 5 (2001).
Autor principal: Attiya, Hagit
Formato: Artículo
Lenguaje:English
Materias: