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=-0.4 required=5.0 tests=AC_FROM_MANY_DOTS,BAYES_00 autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: 103376,da38106463609bde X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII Path: g2news1.google.com!news4.google.com!news.glorb.com!blackbush.cw.net!cw.net!newsfeed01.sul.t-online.de!t-online.de!news.tiscali.de!not-for-mail From: Wilhelm Spickermann Newsgroups: comp.lang.ada Subject: Re: Ada and multi-core CPUs Date: Sat, 10 Sep 2005 10:27:34 +0200 Organization: Tiscali Germany Usenet Message-ID: References: NNTP-Posting-Host: p83.129.24.21.tisdip.tiscali.de Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-15 Content-Transfer-Encoding: 8Bit X-Trace: ulysses.news.tiscali.de 1126340854 51663 83.129.24.21 (10 Sep 2005 08:27:34 GMT) X-Complaints-To: abuse@tiscali.de NNTP-Posting-Date: Sat, 10 Sep 2005 08:27:34 +0000 (UTC) User-Agent: KNode/0.8.0 Xref: g2news1.google.com comp.lang.ada:4562 Date: 2005-09-10T10:27:34+02:00 List-Id: Hi, tmoran@acm.org wrote: > I�split�the�data�array�in�half, > sorting one half with the main program and the other with a > separate task, then merged the two half-results. Instead of merging, you could also insert another parallel sort, one for both of the upper quarters and the other for both of the lower quarters. After that, only the two inner quarters need to be merged or sorted (perhaps recursively). (see D. E. Knuth: The Art of Computer Programming, Vol III Sorting and Searching, 5.3.4 Networks for Sorting) Wilhelm Spickermann