From: nickroberts@ukf.net (Nick Roberts)
Subject: Re: Parallel Merge Sort
Date: Sun, 24 Feb 2002 03:22:59 GMT
Date: 2002-02-24T03:22:59+00:00 [thread overview]
Message-ID: <3c780e10.1060331@news.cis.dfn.de> (raw)
In-Reply-To: a4juvf$67t$1@star.cs.vu.nl
On Fri, 15 Feb 2002 22:34:07 +0100, "R. Stegers" <rstegers@cs.vu.nl>
strongly typed:
>I want to create a generic package which can sort an array with any type of
>elements. The index is of the integer type. It is also required that the
>merge sort is performed in parallel. I'm a C/C++-programmer with very
>limited Ada experience. I think I got the idea of tasks/rendevous right. I
>run into some problems here:
>...
Ruud, may I ask you please, what is this? Is it an academic exercise, or is
it for a genuine application? If the latter, would you please describe the
application and your target hardware; in particular, what kind of data are
you are sorting, how many are you sorting, and why. (Any speed calculations
you may have made would also be relevant.)
--
Nick Roberts
next prev parent reply other threads:[~2002-02-24 3:22 UTC|newest]
Thread overview: 14+ messages / expand[flat|nested] mbox.gz Atom feed top
2002-02-15 21:34 Parallel Merge Sort R. Stegers
2002-02-15 21:46 ` Pat Rogers
2002-02-19 6:16 ` Adrian Hoe
2002-02-19 6:21 ` Adrian Hoe
2002-02-15 23:02 ` tmoran
2002-02-16 11:09 ` R. Stegers
2002-02-18 10:22 ` Peter Hermann
2002-02-18 20:41 ` R. Stegers
2002-02-18 21:02 ` R. Stegers
2002-02-18 22:29 ` Jeffrey Carter
2002-02-18 22:55 ` tmoran
2002-02-19 21:46 ` Kenneth Almquist
2002-02-24 3:22 ` Nick Roberts [this message]
2002-02-26 20:39 ` R. Stegers
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox