Back to Results
First PageMeta Content
Concurrency control / Computing / Computer architecture / Computer engineering / Linearizability / Safe semantics / Processor register / Shared register / Atomic semantics


Exercise 11: Counting 1 The goal of this exercise is to understand the consistency properties of the bounded max register implementation from the lecture. a) Show that if one always writes to R< if i < M , regardless of
Add to Reading List

Document Date: 2015-01-14 07:29:22


Open Document

File Size: 106,33 KB

Share Result on Facebook