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,start
X-Google-Attributes: gid103376,public
From: "Mark Verstege" <s371317@student.uq.edu.au>
Subject: sorting using dynamic tasks
Date: 2000/04/29
Message-ID: <01bfb1b0$5f391480$03010a0a@mark>#1/1
X-Deja-AN: 617104223
X-Complaints-To: news@uq.edu.au
X-Trace: bunyip.cc.uq.edu.au 956994136 32010 172.20.85.240 (29 Apr 2000
 07:42:16 GMT)
Organization: University of Queensland
NNTP-Posting-Date: 29 Apr 2000 07:42:16 GMT
Newsgroups: comp.lang.ada
Date: 2000-04-29T07:42:16+00:00
List-Id: <comp.lang.ada>

Hi,

Does anyone know how to implement a sorting algorithm using dataflow
networks with semaphores in Ada? (I know about semaphores, it's the sorting
problem that I can't figure out.)

I'm trying to use semaphores, and get integers from standard input. I am
trying to create dynamicly allocated task types to do it. In other words, I
keep retrieving values and create a binary tree like dataflow of tasks.
When I have all input, then values are sent back up each level one by one,
when the parent task is ready to read the next value.

Regards,
	Mark