From: "Mark Verstege" <s371317@student.uq.edu.au>
Subject: Re: sorting using dynamic tasks
Date: 2000/05/01
Date: 2000-05-01T02:41:06+00:00 [thread overview]
Message-ID: <01bfb318$a289f380$03010a0a@mark> (raw)
In-Reply-To: BU1P4.946$Q47.807166@news.pacbell.net
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. ;)
>
next prev parent reply other threads:[~2000-05-01 0:00 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
2000-04-29 0:00 sorting using dynamic tasks Mark Verstege
2000-04-30 0:00 ` tmoran
2000-05-01 0:00 ` Mark Verstege [this message]
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