<s>
Szymański	O
's	O
Mutual	B-Operating_System
Exclusion	I-Operating_System
Algorithm	I-Operating_System
is	O
a	O
mutual	B-Operating_System
exclusion	I-Operating_System
algorithm	I-Operating_System
devised	O
by	O
computer	O
scientist	O
Dr.	O
Bolesław	O
Szymański	O
,	O
which	O
has	O
many	O
favorable	O
properties	O
including	O
linear	O
wait	O
,	O
and	O
which	O
extension	O
solved	O
the	O
open	O
problem	O
posted	O
by	O
Leslie	O
Lamport	O
whether	O
there	O
is	O
an	O
algorithm	O
with	O
a	O
constant	O
number	O
of	O
communication	O
bits	O
per	O
process	O
that	O
satisfies	O
every	O
reasonable	O
fairness	O
and	O
failure-tolerance	O
requirement	O
that	O
Lamport	O
conceived	O
of	O
(	O
Lamport	O
's	O
solution	O
used	O
n	O
factorial	O
communication	O
variables	O
vs.	O
Szymański	O
's	O
5	O
)	O
.	O
</s>
<s>
The	O
implementation	O
consists	O
of	O
each	O
process	O
having	O
a	O
flag	O
variable	O
which	O
is	O
written	O
by	O
that	O
process	O
and	O
read	O
by	O
all	O
others	O
(	O
this	O
single-writer	O
property	O
is	O
desirable	O
for	O
efficient	O
cache	B-General_Concept
usage	O
)	O
.	O
</s>
