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=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,292c095d622af1d0 X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Received: by 10.68.195.131 with SMTP id ie3mr12319478pbc.8.1337314350066; Thu, 17 May 2012 21:12:30 -0700 (PDT) MIME-Version: 1.0 Path: pr3ni12654pbb.0!nntp.google.com!news1.google.com!feed-C.news.volia.net!volia.net!news2.volia.net!feed-A.news.volia.net!newsfeed.utanet.at!newsfeed.tele2net.at!weretis.net!feeder4.news.weretis.net!nuzba.szn.dk!news.jacob-sparre.dk!munin.jacob-sparre.dk!pnx.dk!.POSTED!not-for-mail From: "Randy Brukardt" Newsgroups: comp.lang.ada Subject: Re: basic question on Ada tasks and running on different cores Date: Thu, 17 May 2012 23:12:22 -0500 Organization: Jacob Sparre Andersen Research & Innovation Message-ID: References: <30585369.219.1336470732142.JavaMail.geo-discussion-forums@ynbq3> NNTP-Posting-Host: static-69-95-181-76.mad.choiceone.net X-Trace: munin.nbi.dk 1337314348 29398 69.95.181.76 (18 May 2012 04:12:28 GMT) X-Complaints-To: news@jacob-sparre.dk NNTP-Posting-Date: Fri, 18 May 2012 04:12:28 +0000 (UTC) X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2900.5931 X-RFC2646: Format=Flowed; Response X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.6157 Date: 2012-05-17T23:12:22-05:00 List-Id: "Jeffrey Carter" wrote in message news:jp1ivb$o6m$1@adenine.netfront.net... > On 05/16/2012 05:11 PM, Randy Brukardt wrote: >> >> The problem is, if you're trying to implement fine-grained parallelism, >> you >> have to surround that code with some sort of scheduling mechanism, and >> that >> overhead means you aren't going to get anywhere near 100% of the CPU at >> any >> point. > > The assumption here is that there are more tasks/threads/parallel things > than there are processors/cores. That's generally true now, but they way > things are going, it may not be true in the not-too-distant future (1-atom > transistors could make for a lot of cores). When you have a core per task > you no longer need scheduling. Scheduling includes deciding *what* to run, as well as *when* to run it. If there are enough cores, *when* becomes trivial, but *what* still requires overhead (and data communication, as Dmitry noted). There are special cases were *what* is pre-determined (SIMD machines), but for general workloads, determining what to run will still add costs. Randy.