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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,d6a57a46c2bdfa5b X-Google-Attributes: gid103376,public From: tmoran@bix.com Subject: Re: sorting using dynamic tasks Date: 2000/05/03 Message-ID: #1/1 X-Deja-AN: 618768222 References: <8ep0vu$jvg$1@nnrp1.deja.com> X-Complaints-To: abuse@pacbell.net X-Trace: news.pacbell.net 957374060 206.170.25.212 (Wed, 03 May 2000 10:14:20 PDT) Organization: SBC Internet Services NNTP-Posting-Date: Wed, 03 May 2000 10:14:20 PDT Newsgroups: comp.lang.ada Date: 2000-05-03T00:00:00+00:00 List-Id: > > I sent the code for "Batcher's parallel sort" via e-mail. > > Hmmm! this is of course a very typical assignment. Perhaps > you should put this code up on the web. > For example, submit it to adapower as an example. I have in fact submitted it to AdaPower. It was already out there in public (posted on Byte Information Exchange in 1988), as well as in Knuth Volume 3. The style is sufficiently odd that a student turning it in as his own would certainly have to change the style, at the very least, or even the least suspicious teacher would notice. Since the original poster actually asked for tasking using semaphores this is probably not his homework solution. It does use tasks to do sorting, and thus might be helpful to him.