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 autolearn=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail From: Paul Rubin Newsgroups: comp.lang.ada Subject: Re: Toy computational "benchmark" in Ada (new blog post) Date: Thu, 06 Jun 2019 23:00:29 -0700 Organization: A noiseless patient Spider Message-ID: <87tvd2vssi.fsf@nightsong.com> 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> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: reader02.eternal-september.org; posting-host="b0f0f522fb2e31df244925cac2903ee1"; logging-data="28822"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+Njczh7J19Jq1wUhM43Yii" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/25.3 (gnu/linux) Cancel-Lock: sha1:IqFWNi3Qd0KnGZnrBZbIKHGDlPw= sha1:iarwPmp0zoAkGGSTqEZsSS1Ah3k= Xref: reader01.eternal-september.org comp.lang.ada:56525 Date: 2019-06-06T23:00:29-07:00 List-Id: 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. >> 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.