Re: Ada and multi-core CPUs

[Wilhelm Spickermann <uza.20.unbenutzbar@spamgourmet.com>]

Hi,

tmoran@acm.org wrote:

> Iï¿œsplitï¿œtheï¿œdataï¿œarrayï¿œinï¿œhalf,
> sorting one half with the main program and the other with a
> separate task, then merged the two half-results.

Instead of merging, you could also insert another parallel sort,
one for both of the upper quarters and the other for both of the
lower quarters. After that, only the two inner quarters need to
be merged or sorted (perhaps recursively). 
(see D. E. Knuth: The Art of Computer Programming, Vol III
Sorting and Searching, 5.3.4 Networks for Sorting)

Wilhelm Spickermann