Re: Ravenscar-compliant bounded buffer

[Jean-Pierre Rosen <rosen@adalog.fr>]

Dmitry A. Kazakov a �crit :
> P.S. As a general note. This object might interesting as an exercise, but
> not likely needed. In a real application it would be strange to expect
> multiple consumers taking integers out of buffer in some unpredictable
> order. Normally, it is so that either there is one producer and one or many
> consumers (like in distribution of jobs), or else there is many producers
> and one consumer (like writing to log file). This might sufficiently
> simplify the design. Yet another variant is multiple consumers receiving
> whole waveform of integers put to the buffer (broadcasting). This would be
> more difficult.
> 
Anyway, your solution is Ravenscar compliant only if there is exactly 
one producer and one consumer, otherwise there is a possibility of 
having more than one task on the entry queue.

For those who might wonder:
The limitation on only one task per queue is intended to guarantee 
bounded waiting time. Any solution that tries to work around the 
Ravenscar rules in order to have longer queues will violate this 
restriction at some point, or have to manage explicit lists - thus 
violating the spirit of the profile!

-- 
---------------------------------------------------------
            J-P. Rosen (rosen@adalog.fr)
Visit Adalog's web site at http://www.adalog.fr