Mutual Exclusion

Mutual exclusion is a property of concurrency control; which is instituted for the purpose of preventing race conditions.

Parameters

Filters

Displaying 7 of 7 algorithms


Taubenfeld's black-white bakery algorithm	2004	$O(n)$	$O(1)$ per process, $O(n)$ total
Naimi-Trehel's algorithm	1996	$O(\log n)$	$O(1)$ per process, $O(n)$ total
Chan-Singhal-Liu	1990	$O(\log n)$	$O(1)$ per process, $O(n)$ total
Szymanski's algorithm	1988	$O(n)$	$O(1)$ per process, $O(n)$ total
Maekawa's algorithm	1985	$O(n^{0.5})$	$O(1)$ per process, $O(n)$ total
Peterson's algorithm	1981	$O(n)$	$O(n)$ total
Lamport's bakery algorithm	1974	$O(n)$	$O(1)$ per process, $O(n)$ total

Insuffient Data to display table

Displaying 2 of 2 other relevant algorithms


Raymond's algorithm	1997	(none)
Suzuki-Kasami's algorithm	1985	(none)