From: "Mark Verstege" <s371317@student.uq.edu.au>
Subject: sorting using dynamic tasks
Date: 2000/04/29
Date: 2000-04-29T07:42:16+00:00 [thread overview]
Message-ID: <01bfb1b0$5f391480$03010a0a@mark> (raw)
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
next reply other threads:[~2000-04-29 0:00 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
2000-04-29 0:00 Mark Verstege [this message]
2000-04-30 0:00 ` sorting using dynamic tasks tmoran
2000-05-01 0:00 ` Mark Verstege
2000-05-01 0:00 ` tmoran
2000-05-03 0:00 ` Robert Dewar
2000-05-03 0:00 ` Alfred Hilscher
2000-05-03 0:00 ` Ted Dennison
2000-05-03 0:00 ` tmoran
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox