Re: tasking design considerations

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

On 20/01/2017 09:07, rrr.eee.27@gmail.com wrote:
> I am still trapped in old school linear thinking and I am facing a
> tasking design problem.
>
> On channel A I receive messages in a irregular way. I then have to
> collect all messages of a given time frame T, process the messages that
> lie within the time frame and then send out the result to channel B.
 >
> For the ease of reasoning you can assume typically around 0 .. 20
> messages (the maximum certainly << 1000 messages) per time frame T. The
> cycle time of T is fixed now to 1 minute, but might go down in the
> future to 1 second. Channel B of course has exactly one message per T.
> The channels are TCP sockets. Reception of a single complete message in
> channel A activates callback function in my program.
>
> I want now create a protected object stack. The callbacks from
> channel  A fill the stack on the top. A cyclic task with a cycle time T reads and
> removes all collected messages from the bottom of the stack. The task
> processes the messages and sends out the result.
>
> Does that sound like a reasonable and feasable design? I'm looking
> forward to any feedback.

Yes. Two minor notes:

1. It is not a stack (LIFO) it a FIFO, I suppose you want to keep the 
messages ordering.

2. You don't need a protected object or other locking method because a 
FIFO with a single writer and a single reader is task-safe (can be 
designed lock-free).

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