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=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
Path: utzoo!attcan!uunet!wuarchive!zaphod.mps.ohio-state.edu!sdd.hp.com!elroy.jpl.nasa.gov!ames!pasteur!ucbvax!TITAN.TSD.ARLUT.UTEXAS.EDU!steve
From: steve@TITAN.TSD.ARLUT.UTEXAS.EDU (Steve Glicker)
Newsgroups: comp.lang.ada
Subject: Predicting Execution Times
Message-ID: <9004061841.AA10939@titan.tsd.arlut.utexas.edu>
Date: 6 Apr 90 18:41:27 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The Internet
List-Id: <comp.lang.ada>

In <66027@scrsip.UUCP> Steve Vestal writes:

> It's possible to have the compiler predict performance for more than
> just basic blocks using some control flow analysis (e.g. U. Toronto's
> Realtime Euclid). ...

We are _very_ interested in ways to predict the performance of
real-time systems.  I would greatly appreciate references to work in
this area including the "U. Toronto's Realtime Euclid".  If there is
sufficient interest, I would be glad to post the responses.

Steve Glicker
Applied Research Laboratories
(a department of)
The University of Texas at Austin
(steve@titan.tsd.arlut.utexas.edu)