Re: Specifying time limits in source code ?

KSG <kgatlin@cs.ucsd.edu>
19 Jul 1999 01:28:57 -0400

          From comp.compilers

Related articles
Specifying time limits in source code ? hat@se-46.wpa.wtb.tue.nl (1999-07-14)
Re: Specifying time limits in source code ? chase@world.std.com (David Chase) (1999-07-19)
Re: Specifying time limits in source code ? cbrtjr@ix.netcom.com (Charles E. Bortle, Jr.) (1999-07-19)
Re: Specifying time limits in source code ? rweaver@ix.netcom.com (1999-07-19)
Re: Specifying time limits in source code ? kgatlin@cs.ucsd.edu (KSG) (1999-07-19)
Re: Specifying time limits in source code ? dtruong@irisa.fr (Dan Truong) (1999-07-20)
Re: Specifying time limits in source code ? mslamm@mscc.huji.ac.il (Ehud Lamm) (1999-07-20)
Re: Specifying time limits in source code ? mslamm@mscc.huji.ac.il (Ehud Lamm) (1999-07-21)
Re: Specifying time limits in source code ? gneuner@dyn.com (1999-07-23)
| List of all articles for this month |

From: KSG <kgatlin@cs.ucsd.edu>
Newsgroups: comp.compilers
Date: 19 Jul 1999 01:28:57 -0400
Organization: Univ of Calif San Diego
References: 99-07-049
Keywords: realtime

hat@se-46.wpa.wtb.tue.nl wrote:
> Therefore, it would be better if a hard guarantee could be given that
> the processor will never take more than x (micro) seconds for a
> certain piece of code. A compiler can help here.


If you know how long each instruction takes (and it sounds like you
are running on a more restricted class of machines where the problem
fits in memory and stuff so issues of "where is the data coming from
aren't problematic") can you just generate the assembly and then
simply annotate this with the amount of time each instruction takes
(you stated you had this information as well). IBMs xlc/xlf compilers
currently have this capability. From this you can generate a whole
slew of statistics including runtime of any given fragment given that
you know things like the number of iterations a loop will execute
(which you seemed willing to provide).


If you want to be conservative, as it sounds you do, you can ignore
issues of pipelining and out-of-order issue to get a conservative
upper bound.
--
Peace,


KSG
Droppin' Science in REAL AUDIO on KSDT Sundays 8pm-10pm (PST)
ARCHIVED SHOWS: http://scw.ucsd.edu/droppinscience
Personal: http://www.cs.ucsd.edu/~kgatlin


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.