Re: Toy computational "benchmark" in Ada (new blog post)

[David Trudgett <dktrudgett@gmail.com>]

Il giorno venerdì 7 giugno 2019 16:00:31 UTC+10, Paul Rubin ha scritto:

> David Trudgett writes:
> > You have not coded the same thing as the Ada code. Do you know any Ada
> > at all?
> 
> Not much.  I followed the single threaded code pretty closely though,
> then used what I think is the current idiomatic C++ method of doing this
> stuff with threads, since C++ doesn't have Ada-like tasks.

Okay. Even with the single threaded one, you will see that no setup time is included in the timing of the work.

> 
> >> At each of the 50 calculation runs, I launch 4 threads
> > As you should know, the Ada code does not do this.
> 
> Yes I'll see if I can rework the C++ code to not launch new threads at
> each run.  The total number of threads launched isn't all that large
> though, and there are never more than 4 running concurrently.

It doesn't matter if you don't time that part of the execution. But I'm guessing that would be hard in C++.

Cheers,
David