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.66.7.228 with SMTP id m4mr14345898paa.47.1464469683027; Sat, 28 May 2016 14:08:03 -0700 (PDT) X-Received: by 10.157.1.204 with SMTP id e70mr251748ote.4.1464469682960; Sat, 28 May 2016 14:08:02 -0700 (PDT) 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!q6no2316161igz.0!news-out.google.com!yi6ni1329igc.0!nntp.google.com!b4no114352igl.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Sat, 28 May 2016 14:08:02 -0700 (PDT) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=78.192.88.225; posting-account=21X1fwoAAABfSGdxRzzAXr3Ux_KE3tHr NNTP-Posting-Host: 78.192.88.225 User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <22fc2a58-67ad-4483-bf9c-0bdc463b31ab@googlegroups.com> Subject: User threads in Ada ? From: Hadrien Grasland Injection-Date: Sat, 28 May 2016 21:08:03 +0000 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Xref: news.eternal-september.org comp.lang.ada:30507 Date: 2016-05-28T14:08:02-07:00 List-Id: Hi everyone, Recently, cooperatively scheduled user threads have become popular again in= the parallel programming community. The main goal behind their use is typi= cally to avoid spawning, blocking and liberating kernel threads all the tim= e, which comes with some significant overhead. Some C++ libraries such as Intel TBB and HPX now make it much easier and po= rtable than before to deal with such user threads, in no small part thanks = to a couple of nice abstractions, such as asynchronous function calls retur= ning futures that provide event-like synchronization. I'm currently playing around with this concept in Ada, and wondering how fa= r it can be taken. The first thing to do being, of course, to tell what is = already there. Is anyone aware of previous work related to implementing use= r threads in Ada ? Cheers, Hadrien