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=3.8 required=5.0 tests=BAYES_00,INVALID_MSGID,
	RATWARE_MS_HASH,RATWARE_OUTLOOK_NONAME 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: "Mark Verstege" <s371317@student.uq.edu.au>
Subject: Re: sorting using dynamic tasks
Date: 2000/05/01
Message-ID: <01bfb318$a289f380$03010a0a@mark>#1/1
X-Deja-AN: 617701149
References: <01bfb1b0$5f391480$03010a0a@mark>
 <BU1P4.946$Q47.807166@news.pacbell.net>
X-Complaints-To: news@uq.edu.au
X-Trace: bunyip.cc.uq.edu.au 957148866 7989 172.20.85.240 (1 May 2000 02:41:06
 GMT)
Organization: University of Queensland
NNTP-Posting-Date: 1 May 2000 02:41:06 GMT
Newsgroups: comp.lang.ada
Date: 2000-05-01T02:41:06+00:00
List-Id: <comp.lang.ada>

No I hadn't heard of it. Do you have code for it by any chance?


Any help appreciated,

Mark

tmoran@bix.com wrote in article <BU1P4.946$Q47.807166@news.pacbell.net>...
> >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. ;)
>