From: tmoran@bix.com
Subject: Re: sorting using dynamic tasks
Date: 2000/04/30
Date: 2000-04-30T00:00:00+00:00 [thread overview]
Message-ID: <BU1P4.946$Q47.807166@news.pacbell.net> (raw)
In-Reply-To: 01bfb1b0$5f391480$03010a0a@mark
>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-04-30 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 [this message]
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