20 search results - page 1 / 4 » A fast and accurate method for determining a lower bound on ... |
CONCURRENCY
2004
13 years 7 months ago
2004
DDECS
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
BMCBI
2010
13 years 4 months ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
RTSS
2005
IEEE
14 years 1 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
MEMOCODE
2003
IEEE
14 years 21 days ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...