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-26 12:45:05 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!surfnet.nl!star.cs.vu.nl!not-for-mail From: "R. Stegers" Newsgroups: comp.lang.ada Subject: Re: Parallel Merge Sort Date: Tue, 26 Feb 2002 21:39:40 +0100 Organization: Fac. Wiskunde & Informatica, VU, Amsterdam Message-ID: References: <3c780e10.1060331@news.cis.dfn.de> NNTP-Posting-Host: kits.cs.vu.nl X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Xref: archiver1.google.com comp.lang.ada:20473 Date: 2002-02-26T21:39:40+01:00 List-Id: I have to say it's only an academic excercise. We have a course called 'Principles of programming languages'. 5 Assignments in 5 different languages (Prolog, Perl, Ada, SmallTalk and Gofer) have to be programmed. As you can see, the 5 languages give an impression of the different language types (imperative, oo, functional, logical). The assignment for Ada is to write a parallel merge-sort which can sort a list of any type. If you'r interested in my sollution I can email my source to you. It's working fine now. To make it work for huge lists it has to be adapted. Now for every split of the list, two new tasks are created while the previously tasks are suspended. This creates quite a lot of task (threads) which might be avoided (but that cannot be part of the assignment which stated that a task should create two new sub-tasks every time the list is split into 2). Ruud