|
Summary: University of Utah
School of Computing
CS68101
Consistency Models
Sequential
· equal to some sequential execution of the parallel accesses
· many interleavings are possible
· effectively requires a memory reference to wait for all of the invalidations to
complete
· simple model for the programmer
· possibly inefficient due to the stronger ordering requirement
· if programmers use synchronization primitives then this can be relaxed
Relaxed consistency
· allows reads and writes to complete out of order
· several variants
· assumes that programs contain explicit synchronization to control sharing
University of Utah
School of Computing
CS68102
Relaxed Consistency
|
