Re: Worst case execution time problem
- From: CBFalconer <cbfalconer@xxxxxxxxx>
- Date: Sat, 30 Dec 2006 08:46:10 -0500
Hans-Bernhard Bröker wrote:
David T. Ashley wrote:.... snip ...
Hans, ... in general the problem is undecideable, but for most
specific practical examples in embedded work you can just examine
all the branch paths and loops and find a maximum.
There's a fiercely dangerous dragon hiding behind that little word
"just". There will often be way more branch paths and loops to
examine than expected, turning this innocent looking "just" into
one heck of a lot of work.
However, if you keep functions short and understandable (meaning
simple) it often is fairly easy to characterize them for max
execution time, possibly in terms of their parameters. Then this
can be used, in turn, for the calling functions. This process will
expose the 'undecideable' routines and will often suggest
modifications to make such routines decideable. The use of global
variables can easily defeat this effort.
--
Merry Christmas, Happy Hanukah, Happy New Year
Joyeux Noel, Bonne Annee.
Chuck F (cbfalconer at maineline dot net)
<http://cbfalconer.home.att.net>
.
- References:
- Worst case execution time problem
- From: Christian Christmann
- Re: Worst case execution time problem
- From: Hans-Bernhard Bröker
- Re: Worst case execution time problem
- From: David T. Ashley
- Re: Worst case execution time problem
- From: Hans-Bernhard Bröker
- Worst case execution time problem
- Prev by Date: Re: SD-MMC writing FAT
- Next by Date: Re: configuration- inductive loops - mixed traffic ( indian road conditions )- microcontrollers
- Previous by thread: Re: Worst case execution time problem
- Next by thread: Re: Worst case execution time problem
- Index(es):
Relevant Pages
|
