comp.lang.ada
 help / color / mirror / Atom feed
From: rrr.eee.27@gmail.com
Subject: tasking design considerations
Date: Fri, 20 Jan 2017 00:07:38 -0800 (PST)
Date: 2017-01-20T00:07:38-08:00	[thread overview]
Message-ID: <396469b6-6efe-49e7-914b-9226637e031e@googlegroups.com> (raw)

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.

best regards
    RE


             reply	other threads:[~2017-01-20  8:07 UTC|newest]

Thread overview: 6+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2017-01-20  8:07 rrr.eee.27 [this message]
2017-01-20  8:29 ` tasking design considerations Björn Lundin
2017-01-20  8:42 ` Dmitry A. Kazakov
2017-01-20 12:32   ` rrr.eee.27
2017-01-20 14:11     ` Dmitry A. Kazakov
2017-01-20 16:01 ` Jeffrey R. Carter
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox