On Mon, Oct 30, 2017 at 6:29 PM wrote:
> I noticed a very strange effect by translating the
> mutual exclusion algorithm of E. W. Dijkstra to Go.
For every combination of lines A/B present/not present, the program has
data races, so there's nothing to reason about.
You can try it by yourself by
I think it's the non-preemptive scheduler that hits you.
Afaik it is a known behavior that I am not sure how to fix.
I did not at all look at the solution itself.
mån 30 okt. 2017 kl 18:29 skrev :
> Dear Go-community,
>
> I noticed a very strange effect by translating the
> mutual exclusion algor
Dear Go-community,
I noticed a very strange effect by translating the
mutual exclusion algorithm of E. W. Dijkstra to Go.
Reference:
Cooperating Sequential Processes. Technical Report EWD-123,
Technological University Eindhoven (1965)
http://www.cs.utexas.edu/users/EWD/ewd01xx/EWD123.PDF)
I
