From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 X-Received: by 2002:a24:740f:: with SMTP id o15mr3254739itc.76.1559888712212; Thu, 06 Jun 2019 23:25:12 -0700 (PDT) X-Received: by 2002:aca:d550:: with SMTP id m77mr2852008oig.155.1559888711969; Thu, 06 Jun 2019 23:25:11 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!feeder.eternal-september.org!news.linkpendium.com!news.linkpendium.com!news.snarked.org!border2.nntp.dca1.giganews.com!nntp.giganews.com!s188no170510itb.0!news-out.google.com!l126ni234itl.0!nntp.google.com!s188no170508itb.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Thu, 6 Jun 2019 23:25:11 -0700 (PDT) In-Reply-To: <87tvd2vssi.fsf@nightsong.com> Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=2001:8004:1420:de2:3c2c:6580:a925:cfe; posting-account=rfeywQoAAAC0TKn5ZjdVW0ytcQM1oMSv NNTP-Posting-Host: 2001:8004:1420:de2:3c2c:6580:a925:cfe References: <55b14350-e255-406c-ab11-b824da77995b@googlegroups.com> <6776b034-1318-49b3-8ff5-5a2f746fac9c@googlegroups.com> <87blzaxnei.fsf@nightsong.com> <877e9yxamb.fsf@nightsong.com> <5425afe3-8e22-4b1b-913c-f274fac7021a@googlegroups.com> <87tvd2vssi.fsf@nightsong.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <4c95ff02-43c4-44aa-ab65-db688f0c2e17@googlegroups.com> Subject: Re: Toy computational "benchmark" in Ada (new blog post) From: David Trudgett Injection-Date: Fri, 07 Jun 2019 06:25:12 +0000 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Xref: reader01.eternal-september.org comp.lang.ada:56528 Date: 2019-06-06T23:25:11-07:00 List-Id: Il giorno venerd=C3=AC 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? >=20 > 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. >=20 > >> At each of the 50 calculation runs, I launch 4 threads > > As you should know, the Ada code does not do this. >=20 > 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 gue= ssing that would be hard in C++. Cheers, David