From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,2ccbce6c5ad05bfd
X-Google-Attributes: gid103376,public
From: bobduff@world.std.com (Robert A Duff)
Subject: Re: Can OO be successful in real-time embedded systems?
Date: 1996/05/10
Message-ID: <Dr702w.50H@world.std.com>#1/1
X-Deja-AN: 154122071
references: <m0uHHBP-0000ztC@crash.cts.com> <Dr58I4.6Go@world.std.com>
 <3191DE76.130F@lmtas.lmco.com>
 <Pine.GSO.3.92.960509164924.1191A-100000@nunic.nu.edu>
organization: The World Public Access UNIX, Brookline, MA
newsgroups: comp.lang.ada
Date: 1996-05-10T00:00:00+00:00
List-Id: <comp.lang.ada>


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