A Fast Mutual Exclusion Algorithm Leslie Lamport November 14, 1985 revised October 31, 1986 This report appeared in the ACM Transactions on Computer Systems, - Blocking set - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2000-06-26 12:35:19 Open Document File Size: 131,25 KB Share Result on Facebook City Palo Alto / / Company Digital Equipment Corporation / / Facility Systems Research Center of Digital Equipment Corporation / / IndustryTerm process solutions / mutual exclusion protocol / simplest possible algorithm / speed processors / eﬃcient algorithm / early solutions / ordinary sequential processors / much simpler mutual exclusion algorithms / possible algorithm / faster solution / simpler mutual exclusion algorithms / multiprocessor operating systems / shared-memory mutual exclusion algorithms / / Organization Systems Research Center / / Person Michael Fischer / / Position Author / Butler / / ProvinceOrState California / / Technology mutual exclusion protocol / eﬃcient algorithm / following algorithm / high-speed processors / much simpler mutual exclusion algorithms / simplest possible algorithm / operating system / shared memory / operating systems / ordinary sequential processors / shared-memory mutual exclusion algorithms / / SocialTag Concurrent computing Linearizability Non-blocking algorithm Test-and-set Lock Mutual exclusion Parallel computing Deadlock Critical section Concurrency control

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