Re: Parallel Merge Sort

["R. Stegers" <rstegers@cs.vu.nl>]

I have to say it's only an academic excercise. We have a course called
'Principles of programming languages'. 5 Assignments in 5 different
languages (Prolog, Perl, Ada, SmallTalk and Gofer) have to be programmed.

As you can see, the 5 languages give an impression of the different language
types (imperative, oo, functional, logical).

The assignment for Ada is to write a parallel merge-sort which can sort a
list of any type.

If you'r interested in my sollution I can email my source to you. It's
working fine now. To make it work for huge lists it has to be adapted. Now
for every split of the list, two new tasks are created while the previously
tasks are suspended. This creates quite a lot of task (threads) which might
be avoided (but that cannot be part of the assignment which stated that a
task should create two new sub-tasks every time the list is split into 2).

Ruud