From: tmoran@acm.org
Subject: Re: Ada and multi-core CPUs
Date: Sat, 10 Sep 2005 12:27:05 -0500
Date: 2005-09-10T12:27:05-05:00 [thread overview]
Message-ID: <h6WdnZ2dnZ1ZtJDznZ2dnfSKvt6dnZ2dRVn-y52dnZ0@comcast.com> (raw)
In-Reply-To: dfu5dm$1ief$1@ulysses.news.tiscali.de
> Instead of merging, you could ...
There are many ways to make a parallel sort. My point was that here
is a very standard time consuming operation, very simple Ada code can
make a simple dual-tasking version, and that version on a hyperthreading
CPU really does run a lot faster.
next prev parent reply other threads:[~2005-09-10 17:27 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
2005-09-09 21:33 Ada and multi-core CPUs tmoran
2005-09-10 8:27 ` Wilhelm Spickermann
2005-09-10 17:27 ` tmoran [this message]
2005-09-10 22:01 ` Adrian Knoth
2005-09-10 22:49 ` tmoran
2005-09-12 16:21 ` Jeffrey Carter
2005-09-12 15:48 ` Marc A. Criley
2005-09-12 19:43 ` 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