Re: Workqueues in Ada

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On Sat, 28 Jul 2007 17:00:57 +0000 (UTC), Wiktor Moskwa wrote:

> The problem is that my poor implementation of workqueue is a 
> bottleneck. A task takes a unit of work from a queue, processes it 
> and puts it back at the and of the queue. Because the queue is 
> Ada.Containers.Doubly_Linked_Lists there are lots of memory
> allocations and deallocations - that's a performance problem.

I thought Ada.Containers.Doubly_Linked_Lists can move elements between
lists without copying. Have you checked that?

You could also try an alternative implementation of doubly-linked lists and
webs:

http://www.dmitry-kazakov.de/ada/components.htm#Generic_Doubly_Linked_Web

> I consider making a circular list of nodes with "Next_To_Service"
> pointer going around as nodes are processed. I'll have to make
> sure that one node can be served by only one task at the time
> (probably by marking nodes as being served at the moment).
> New nodes joining and old leaving the system will be more
> difficult to implement correctly, I suppose.

Make it a protected object. A worker task calls to an entry of, requesting
an item of work. The entry removes the first item from the list and returns
it to the task via pointer. When the worker task finishes dealing with the
item it calls to a protected object's procedure to queue the item back.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de