<s>
Relativistic	B-Language
programming	I-Language
(	O
RP	O
)	O
is	O
a	O
style	O
of	O
concurrent	B-Architecture
programming	I-Architecture
where	O
instead	O
of	O
trying	O
to	O
avoid	O
conflicts	O
between	O
readers	O
and	O
writers	O
(	O
or	O
writers	O
and	O
writers	O
in	O
some	O
cases	O
)	O
the	O
algorithm	O
is	O
designed	O
to	O
tolerate	O
them	O
and	O
get	O
a	O
correct	O
result	O
regardless	O
of	O
the	O
order	O
of	O
events	O
.	O
</s>
<s>
Also	O
,	O
relativistic	B-Language
programming	I-Language
algorithms	O
are	O
designed	O
to	O
work	O
without	O
the	O
presences	O
of	O
a	O
global	O
order	O
of	O
events	O
.	O
</s>
<s>
This	O
essentially	O
implies	O
working	O
under	O
causal	B-General_Concept
consistency	I-General_Concept
instead	O
of	O
a	O
stronger	O
model	O
.	O
</s>
<s>
Relativistic	B-Language
programming	I-Language
provides	O
advantages	O
in	O
performance	O
compared	O
to	O
other	O
concurrency	B-Architecture
paradigms	O
because	O
it	O
does	O
not	O
require	O
one	O
thread	O
to	O
wait	O
for	O
another	O
nearly	O
as	O
often	O
.	O
</s>
<s>
Because	O
of	O
this	O
,	O
forms	O
of	O
it	O
(	O
Read-Copy-Update	B-Operating_System
for	O
instance	O
)	O
are	O
now	O
used	O
extensively	O
in	O
the	O
Linux	B-Operating_System
kernel	I-Operating_System
(	O
over	O
18,000	O
times	O
and	O
has	O
grown	O
from	O
nothing	O
to	O
11.8	O
%	O
of	O
all	O
locking	O
primitives	O
in	O
just	O
under	O
two	O
decades	O
)	O
.	O
</s>
