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

Description complète

Détails bibliographiques
Publié dans:	Journal of the ACM 48, 5 (2001).
Auteur principal:	Attiya, Hagit
Format:	Article
Langue:	English
Sujets:	Computer systems organization. Computer communication networks. Distributed systems. Performance of systems. Software. Programming techniques. Concurrent programming. Software engineering. Interoperability. Distributed objects. Operating systems. Process management. Synchronization. Theory of computation. Computation by abstract devices. Modes of computation. Parallelism and concurrency. Algorithms. Performance. Reliability. Theory.