Re: Workqueues in Ada

["Jeffrey R. Carter" <spam.jrcarter.not@acm.nospam.org>]

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.

A simple thing to do would be to replace Doubly_Linked_Lists with a 
protected, bounded queue, such as PragmARC.Queue_Bounded[_Blocking]. 
This will also serve to validate that it's the dynamic nature of 
Doubly_Linked_Lists that is causing the problem.

The PragmAda Reusable Components are available at

http://pragmada.home.mchsi.com/

-- 
Jeff Carter
"C's solution to this [variable-sized array parameters] has real
problems, and people who are complaining about safety definitely
have a point."
Dennis Ritchie
25