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-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,86cefd3e84a541f2 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-02-23 19:22:59 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!fu-berlin.de!uni-berlin.de!ppp-4-181.5800-9.telinco.NET!not-for-mail From: nickroberts@ukf.net (Nick Roberts) Newsgroups: comp.lang.ada Subject: Re: Parallel Merge Sort Date: Sun, 24 Feb 2002 03:22:59 GMT Message-ID: <3c780e10.1060331@news.cis.dfn.de> References: NNTP-Posting-Host: ppp-4-181.5800-9.telinco.net (212.1.139.181) X-Trace: fu-berlin.de 1014520975 6036520 212.1.139.181 (16 [25716]) X-Newsreader: Forte Free Agent 1.21/32.243 Xref: archiver1.google.com comp.lang.ada:20322 Date: 2002-02-24T03:22:59+00:00 List-Id: On Fri, 15 Feb 2002 22:34:07 +0100, "R. Stegers" strongly typed: >I want to create a generic package which can sort an array with any type of >elements. The index is of the integer type. It is also required that the >merge sort is performed in parallel. I'm a C/C++-programmer with very >limited Ada experience. I think I got the idea of tasks/rendevous right. I >run into some problems here: >... Ruud, may I ask you please, what is this? Is it an academic exercise, or is it for a genuine application? If the latter, would you please describe the application and your target hardware; in particular, what kind of data are you are sorting, how many are you sorting, and why. (Any speed calculations you may have made would also be relevant.) -- Nick Roberts