Date: 2015-01-14 07:29:22Concurrency 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 ListSource URL: resources.mpi-inf.mpg.deDownload Document from Source Website File Size: 106,33 KBShare Document on Facebook
|