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 10.68.65.70 with SMTP id v6mr4394886pbs.1.1418229106790; Wed, 10 Dec 2014 08:31:46 -0800 (PST) X-Received: by 10.140.82.211 with SMTP id h77mr15841qgd.37.1418229106735; Wed, 10 Dec 2014 08:31:46 -0800 (PST) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!news.glorb.com!peer01.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!h15no16896586igd.0!news-out.google.com!r1ni50qat.1!nntp.google.com!w8no5979072qac.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Wed, 10 Dec 2014 08:31:46 -0800 (PST) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=185.30.133.97; posting-account=hya6vwoAAADTA0O27Aq3u6Su3lQKpSMz NNTP-Posting-Host: 185.30.133.97 User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <455d0987-734a-4505-bb39-37bfd1a2cc6b@googlegroups.com> Subject: =?ISO-8859-1?Q?GNAT=A0and_Tasklets?= From: vincent.diemunsch@gmail.com Injection-Date: Wed, 10 Dec 2014 16:31:46 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable X-Received-Bytes: 1924 X-Received-Body-CRC: 1617799004 Xref: news.eternal-september.org comp.lang.ada:23939 Date: 2014-12-10T08:31:46-08:00 List-Id: Hello, I have read some parts of the book from Alan BURNS =AB Concurrent and Real = Time Programming in Ada =BB. He presents in chapter 11 an implementation of= jobs that are submited to a pool of tasks (see :=A0Callables, Executors, F= utures). These jobs are typical of a parallel computation done on a multico= re system, like computing a complex image, for instance. I find this really interesting and want to use this mecanism in the future,= but it raises a question :=A0if we use a library in Ada to do this tasking= , we loose in fact the ability to use tasking directly inside the Ada langa= ge ! And it is easy and cleaner to create a local task inside the subprogra= m for each job. So my question is : does GNAT=A0create a kernel thread for each local task = or is it able to compile local tasks as jobs sent to a pool of tasks create= d in the runtime ? Kind regards, Vincent