Commit 4499cf49 authored by Jacques-Henri Jourdan's avatar Jacques-Henri Jourdan
Browse files

PEtite correction.

parent 723dd036
......@@ -87,10 +87,7 @@ This is guaranteed only if there is a \emph{happens-before} relationship from
the enqueuing event to the dequeuing event.
One possibility would be to guarantee that our concurrent queue implementation behaves like its coarse-grained alternative, that is, a sequential implementation guarded by a lock.
This would correspond to an intuitive definition of linearizability, even though this notion is difficult to define precisely in the world of sequential consistency~\cite{smith2019linearizability}.
% TODO je ne comprends pas trop la phrase, qui dit que linearizability est
% difficile à définir en SC, mais cite un papier qui parle de définir
% linearizability dans un cadre non-SC
This would correspond to an intuitive definition of linearizability, even though this notion is difficult to define precisely outside of the world of sequential consistency~\cite{smith2019linearizability}.
However, our concurrent queue library is weaker than that: it does guarantee \emph{some} happens-before relationships, but not between all pairs of accesses.
Namely, it guarantees a happens-before relationship:
%
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment