A Fast Mutual Exclusion Algorithm Leslie Lamport November 14, 1985 revised October 31, 1986 This report appeared in the ACM Transactions on Computer Systems,

First Page		Document Content
Date: 2000-06-26 12:35:19 Concurrent computing Linearizability Non-blocking algorithm Test-and-set Lock Mutual exclusion Parallel computing Deadlock Critical section Concurrency control Computing Concurrency		A Fast Mutual Exclusion Algorithm Leslie Lamport November 14, 1985 revised October 31, 1986 This report appeared in the ACM Transactions on Computer Systems, Add to Reading List Source URL: research.microsoft.com Download Document from Source Website File Size: 131,25 KB Share Document on Facebook

	Administrivia  Design of Parallel and High-Performance Computing DocID: 1rqkH - View Document
	Administrivia  Design of Parallel and High-Performance Computing DocID: 1rnNM - View Document
	Aaron Turon Research Statement My research lies broadly in the areas of programming languages and verification, with the goal of building reliable software systems. I am drawn to software components that are usually cha DocID: 1rnbf - View Document
	Reagents: Expressing and Composing Fine-grained Concurrency Aaron Turon Northeastern University DocID: 1rk2P - View Document
	Brief Announcement: Selfishness in Transactional Memory Raphael Eidenbenz Roger Wattenhofer Computer Engineering and Networks Lab DocID: 1qKkF - View Document