<--- Back to Details
First PageDocument Content
Edsger W. Dijkstra / Concurrency control / Mutual exclusion / Binary trees
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

Similar Documents