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

תיאור מלא

מידע ביבליוגרפי
הוצא לאור ב:Journal of the ACM 48, 5 (2001).
מחבר ראשי: Attiya, Hagit
פורמט: Article
שפה:English
נושאים: