Sciweavers

20 search results - page 4 / 4
» Deterministic Upperbounds of the Worst-Case Execution Times ...
Sort
View
WORDS
2002
IEEE
14 years 16 days ago
Writing Temporally Predictable Code
The Worst-Case Execution-Time Analysis (WCET Analysis) of program code that is to be executed on modern processors is a highly complex task. First, it involves path analysis, to i...
Peter P. Puschner, Alan Burns
RTS
2006
129views more  RTS 2006»
13 years 7 months ago
Modeling out-of-order processors for WCET analysis
Estimating the Worst Case Execution Time (WCET) of a program on a given processor is important for the schedulability analysis of real-time systems. WCET analysis techniques typic...
Xianfeng Li, Abhik Roychoudhury, Tulika Mitra
ECRTS
2010
IEEE
13 years 8 months ago
Making DRAM Refresh Predictable
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
Balasubramanya Bhat, Frank Mueller
ESA
2001
Springer
75views Algorithms» more  ESA 2001»
14 years 3 days ago
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
Alexander Gaysinsky, Alon Itai, Hadas Shachnai
VEE
2012
ACM
226views Virtualization» more  VEE 2012»
12 years 3 months ago
Protecting applications against TOCTTOU races by user-space caching of file metadata
Time Of Check To Time Of Use (TOCTTOU) race conditions for file accesses in user-space applications are a common problem in Unix-like systems. The mapping between filename and i...
Mathias Payer, Thomas R. Gross