Re: Can OO be successful in real-time embedded systems?

[bobduff@world.std.com (Robert A Duff)]

In article <Pine.GSO.3.92.960509164924.1191A-100000@nunic.nu.edu>,
Richard Riehle  <rriehle@nunic.nu.edu> wrote:
>   However, in hard, real-time systems (HRTS), run-time dispatching is a
>   little more of an issue than a simple case statement.  The controlling
>   factor is whether we can predict that a certain sequence of actions
>   will be time-determinate.

What exactly do you mean by "a little more of an issue"?  The actual
dispatching call can be done in constant time, just like a case
statement does a jump through a table in constant time.  So the *only*
difference is what I mentioned in my previous post: with a case
statement, you have all the alternatives sitting there in one place,
whereas with a dispatching call, they are scattered all over.  Do you
see any *other* differences between case statements and dispatching,
that would affect the ability to do worst-case timing analysis?

- Bob