Technical Report CS719
||A CORRECTNESS CONDITION FOR HIGH-PERFORMANCE MULTIPROCESSORS (Preliminary Version).
||H. Attiya and R. Friedman
|PDF - Revised||CS0719.revised.pdf|
Hybrid Consistency, a new consistency condition for
shared memory multiprocessors, attempts to capture the guarantees
provided by contemporary high-performance architectures.
It combines the expressiveness of strong consistency conditions (e.g.,
sequential consistency, linearizability) and the efficiency of weak
consistency conditions (e.g., Pipelined RAM, causal memory).
Memory access operations are classified as either strong or
weak. A global ordering of strong operations at different
processes is guaranteed, but there is very little guarantee on the
ordering of weak operations at different processes, except for what is
implied by their interleaving with the strong operations. A formal and
precise definition of this condition is given. An efficient implementation of hybrid consistency on distributed memory machines is presented. In this
implementation, weak operations are executed instantaneously, while the
response time for strong operations is linear in the network delay.
(It is proven that this is within a constant factor of the optimal time
To motivate hybrid consistency it is shown that weakly consistent
memories do not support non-cooperative (in particular, non-
centralized) algorithms for mutual exclusion.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1992/CS/CS0719), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1992
To the main CS technical reports page
Computer science department, Technion