214 search results - page 10 / 43 » Data-Flow Frameworks for Worst-Case Execution Time Analysis |
INFOCOM
1993
IEEE
13 years 11 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
WORDS
2003
IEEE
14 years 27 days ago
2003
IEEE
Bounding the Worst Case Execution Time (WCET) of programs is essential for real-time systems. To be able to do WCET calculations, the iteration bounds for loops and recursion must...
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...
ICSM
1994
IEEE
13 years 11 months ago
1994
IEEE
Although data pow analysis was first developed for use in compilers, its usefulness is now recognized in many software tools. Because of its compiler origins, the computation of d...
JEC
2006
13 years 7 months ago
2006
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...