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/04/30 Message-ID: #1/1 X-Deja-AN: 617624975 References: <01bfb1b0$5f391480$03010a0a@mark> X-Complaints-To: abuse@pacbell.net X-Trace: news.pacbell.net 957131425 206.170.24.29 (Sun, 30 Apr 2000 14:50:25 PDT) Organization: SBC Internet Services NNTP-Posting-Date: Sun, 30 Apr 2000 14:50:25 PDT Newsgroups: comp.lang.ada Date: 2000-04-30T00:00:00+00:00 List-Id: >Does anyone know how to implement a sorting algorithm using dataflow >networks with semaphores in Ada? (I know about semaphores, it's the sorting Do you mean "Batcher's Parallel Sort" from Knuth? I don't remember much about it, except it was my first Ada tasking program. ;)