Re: can someone help me with this code (explanation)

[Georg Bauhaus <bauhaus@futureapps.invalid>]

On 30.09.14 06:22, Brad Moore wrote:
> In fact, only the Go and the Haskell entries are consistently ahead of this latest version for all 4 processor configurations. The Ada version has 503 tasks executing with calls on a protected entry (where each task maps to an OS thread in GNAT). Looking at the Go example, I'm guessing that the 503 lightweight threads are being executed by a single OS thread, likely under a work-stealing scheduler, where the work never gets stolen by other cores, since this benchmark mostly involves a sequential handoff of a token to the next thread. It that's whats happening, then it might explain why the Go version is still quite a bit faster, since executing the problem on the same core doesn't require as much overhead and locking to do the handoff.
>
>

FWIW, adding (to #6)

  delay 0.0;

to the task body after the conditional loop exit resulted in some
changes in running time, on my testing machines. Results depend very
much on the compiler, and on (absence of) optimization.
Nothing like the order of magnitude of #6, though.

(On GNU/Linux: the system compiler (Debian, gcc 4.4.5) and GNAT 2013
4.7.4; Xeon E5-2620, two cores of a KVM.)