Re: Parallel Merge Sort

[Adrian Hoe <byhoe@greenlime.com>]

Pat Rogers wrote:
> 
> "R. Stegers" <rstegers@cs.vu.nl> wrote in message
> news:a4juvf$67t$1@star.cs.vu.nl...
> > 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:
> >
> >  - How can I dynamicaly allocate a temporary array (for which i don't know
> > the size in advance?) It seems inpossible to me.
> >  - How to create tasks from within a task: The subTask1 en subTask2
> > declarations generate errors: "Task type cannot be used as type mark within
> > its own body"
> >
> > I hope someone can give me a hint. The code is below.
> 
> Hint: there is a well-known book on concurrent programming in Ada (:-) that
> shows how to do this.....

Alan Burns and Andy Welling's Concurrency in Ada, 1995, Cambridge
University Press.

This is an excellent book for concurrent programming in Ada.
-- 
                              -- Adrian Hoe
                              -- http://greenlime.com/users/adrian.hoe