From: Niklas Holsti <niklas.holsti@tidorum.invalid>
Subject: Re: longest path through a task
Date: Wed, 27 May 2015 23:09:19 +0300
Date: 2015-05-27T23:09:19+03:00 [thread overview]
Message-ID: <csmmjfFg5hU1@mid.individual.net> (raw)
In-Reply-To: <9ad1fcdc-cdf9-4ff0-aa7e-051d53b6736a@googlegroups.com>
On 15-05-27 22:38 , jan.de.kruyf@gmail.com wrote:
> Good day,
>
> I was trying to find a semi-automatic way to find the longest runtime
> path through a task (on an ARM cpu) programmed in ada. Does the gnat
> compiler offer such a thing perhaps?
There are tools calls "WCET analyzers" that compute, or try to compute,
an upper bound on the execution time of a program, or a subprogram.
There are two main groups: static analyzers, exemplified by aiT
(www.absint.com) or Bound-T (www.bound-t.com), and hybrid ones that
combine measurement with control-flow analysis, exemplified by RapiTime
(www.rapitasystems.com).
What kind of ARM are you using? A classic ARM7, or a Cortex? "M" series?
--
Niklas Holsti
Tidorum Ltd
niklas holsti tidorum fi
. @ .
next prev parent reply other threads:[~2015-05-27 20:09 UTC|newest]
Thread overview: 19+ messages / expand[flat|nested] mbox.gz Atom feed top
2015-05-27 19:38 longest path through a task jan.de.kruyf
2015-05-27 20:09 ` Niklas Holsti [this message]
2015-05-28 6:54 ` jan.de.kruyf
2015-05-28 9:04 ` Niklas Holsti
2015-05-28 12:27 ` brbarkstrom
2015-05-28 14:01 ` jan.de.kruyf
2015-05-28 13:04 ` jan.de.kruyf
2015-05-29 4:38 ` Niklas Holsti
2015-05-28 16:37 ` Simon Wright
2015-05-28 17:43 ` jan.de.kruyf
2015-05-28 17:52 ` Simon Wright
2015-05-28 18:12 ` jan.de.kruyf
2015-05-29 16:31 ` Simon Wright
2015-05-30 10:50 ` jan.de.kruyf
2015-06-01 13:32 ` Patrick Noffke
2015-06-01 19:09 ` Simon Wright
2015-06-02 22:15 ` Stephen Leake
2015-06-01 4:27 ` Windows Text_IO.Get_Line issue tornenvi
2015-06-01 5:01 ` tornenvi
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox