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!reader02.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Ada lacks lighterweight-than-task parallelism Date: Wed, 20 Jun 2018 09:13:22 +0200 Organization: Aioe.org NNTP Server Message-ID: References: <993f28de-6a64-480b-9c6e-d9714bcdef0d@googlegroups.com> NNTP-Posting-Host: MyFhHs417jM9AgzRpXn7yg.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:52.0) Gecko/20100101 Thunderbird/52.8.0 Content-Language: en-US X-Notice: Filtered by postfilter v. 0.8.3 Xref: reader02.eternal-september.org comp.lang.ada:53187 Date: 2018-06-20T09:13:22+02:00 List-Id: On 2018-06-20 03:41, Dan'l Miller wrote: > On Tuesday, June 19, 2018 at 8:12:02 PM UTC-5, Shark8 wrote: > I'm not saying anything negative about tasks. I am just saying that there should be more games to play in the casino than merely one and only one. > >> As for something lightweight, we're working on that in the ARG right now: >> * PARALLEL DO blocks, >> * Parallel LOOPs [IIRC, it might be just FOR], and >> * And some other things like operators, blocking-detection, etc. > > Excellent! These should produce slices for numeric computations. I am not as sure that they alone(!) will necessarily produce usable slices regarding non-numeric arbitrary processing via deep call-trees of subprograms. So it is not "lightweight", it is "scalar" parallelism. The latter is quite a niche and IMO has no place in the language being to low-level. It better be handled in the form of hints for the compiler to deploy a certain form of optimization. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de