Exercise 10: Exercising in style Task 1: Very exclusive! a) Give a solution to mutual exclusion using a fetch-and-add register. b) Give a solution to mutual exclusion using a compare-and-swap register. c) Give a solution

First Page		Document Content
Date: 2015-01-06 07:25:52 Edsger W. Dijkstra Concurrency control Mutual exclusion Binary trees		Exercise 10: Exercising in style Task 1: Very exclusive! a) Give a solution to mutual exclusion using a fetch-and-add register. b) Give a solution to mutual exclusion using a compare-and-swap register. c) Give a solution Add to Reading List Source URL: resources.mpi-inf.mpg.de Download Document from Source Website File Size: 80,23 KB Share Document on Facebook

	Automatic Discovery of Mutual Exclusion Algorithms∗ (Preliminary Version) Yoah Bar-David Gadi Taubenfeld DocID: 1vsgn - View Document
	Verifying a Simplification of Mutual Exclusion by Lycklama-Hadzilacos Wim H. Hesselink (whh442, February 24, 2013) Dept. of Computing Science, University of Groningen P.O.Box 407, 9700 AK Groningen, The Netherlands DocID: 1uazK - View Document
	Mutual exclusion algorithms with constant RMR complexity and wait-free exit code Rotem Dvir1 and Gadi Taubenfeld1 1 The Interdisciplinary Center DocID: 1u4E8 - View Document
	Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses Pedro LOPEZ-GARCIA1,2 , Francisco BUENO3 and Manuel HERMENEGILDO1,3 1 DocID: 1tMR8 - View Document
	Administrivia  Design of Parallel and High-Performance Computing DocID: 1rnNM - View Document