Commit 9918b04f authored by POTTIER Francois's avatar POTTIER Francois
Browse files

Typos.

parent f939aab9
......@@ -133,7 +133,7 @@ When calling \tryenqueue, we start by reading the current value~\head\ of the
reference~\refhead. To check that slot~$\modcap\head$ is available for
rank~\head, we read its status.
%
If it differs from~$2\head$, we fail: a status less than~$2\head$ indicates that the buffer is full\footnote{Technically, the public state of the queue may contain less than $C$ elements in this case, so that we may consider it is not full. Here, by ``full'' we mean that next buffer slot is either not reclaimed by anyone or still in the process of being emptied by another thread. Even though the buffer is ``full'', it may have available slots if dequeing has completed more rapidly in these other slots.}, a status greater than~$2\head$ indicates interference from another competing enquing thread, which has been attributed rank~\head{} before we have.
If it differs from~$2\head$, we fail: a status less than~$2\head$ indicates that the buffer is full\footnote{Technically, the public state of the queue may contain less than $C$ elements in this case, so that we may consider it is not full. Here, by ``full'' we mean that the next buffer slot is either not reclaimed by anyone or still in the process of being emptied by another thread. Even though the buffer is ``full'', it may have available slots if dequeuing has completed more rapidly in these other slots.}, a status greater than~$2\head$ indicates interference from another competing enquing thread, which has been attributed rank~\head{} before we have.
If the status is $2\head$, then we try to increment \refhead from~\head\
to~$\head+1$.
......
Supports Markdown
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