Sciweavers

166 search results - page 5 / 34
» Efficient worst case timing analysis of data caching
Sort
View
RTAS
2008
IEEE
14 years 2 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
DAGSTUHL
2004
13 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
DATE
2004
IEEE
156views Hardware» more  DATE 2004»
13 years 11 months ago
Timing Analysis for Preemptive Multi-Tasking Real-Time Systems with Caches
In this paper, we propose an approach to estimate the Worst Case Response Time (WCRT) of tasks in a preemptive multi-tasking single-processor real-time system with a set associati...
Yudong Tan, Vincent John Mooney III
SIGMETRICS
2003
ACM
199views Hardware» more  SIGMETRICS 2003»
14 years 25 days ago
Data cache locking for higher program predictability
Caches have become increasingly important with the widening gap between main memory and processor speeds. However, they are a source of unpredictability due to their characteristi...
Xavier Vera, Björn Lisper, Jingling Xue
ICDE
2007
IEEE
198views Database» more  ICDE 2007»
14 years 9 months ago
Worst-Case Background Knowledge for Privacy-Preserving Data Publishing
Recent work has shown the necessity of considering an attacker's background knowledge when reasoning about privacy in data publishing. However, in practice, the data publishe...
David J. Martin, Daniel Kifer, Ashwin Machanavajjh...