Sciweavers

166 search results - page 12 / 34
» Efficient worst case timing analysis of data caching
Sort
View
DAWAK
2007
Springer
13 years 11 months ago
An Efficient Algorithm for Identifying the Most Contributory Substring
Abstract. Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and pres...
Ben Stephenson
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
JSA
2000
175views more  JSA 2000»
13 years 7 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
MICRO
2008
IEEE
146views Hardware» more  MICRO 2008»
13 years 7 months ago
A small cache of large ranges: Hardware methods for efficiently searching, storing, and updating big dataflow tags
Dynamically tracking the flow of data within a microprocessor creates many new opportunities to detect and track malicious or erroneous behavior, but these schemes all rely on the...
Mohit Tiwari, Banit Agrawal, Shashidhar Mysore, Jo...
ECRTS
2004
IEEE
13 years 11 months ago
Comparing Real-Time Communication Under Electromagnetic Interference
The contribution of this paper is threefold. First, an improvement to a previously published paper on the timing analysis of Controller Area Network (CAN) in the presence of trans...
Ian Broster, Alan Burns, Guillermo Rodrígue...