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). |
|---|---|
| 主要作者: | |
| 格式: | Article |
| 語言: | English |
| 主題: |