Jyh-Charn Liu and Hung-Ju Lee. Deterministic upperbounds of the worst-case execution times of cached programs. In Proceedings of the 15th Real-Time Systems Symposium, pages 182--191, December 1994. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000) (Correct)
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000) (Correct)
Symbolic Cache Analysis for Real-Time Systems - Blieberger, Fahringer, Scholz (1999) (2 citations) (Correct)
Worst-Case Execution Time Analysis for Modern Hardware.. - Ottosson (1997) (29 citations) (Correct)
Efficient Worst Case Timing Analysis of Data Caching - Kim, Min, Ha (1996) (29 citations) (Correct)
Cache Modeling for Real-Time Software: Beyond Direct Mapped.. - Steven (Correct)
An Accurate Worst Case Timing Analysis for RISC.. - Lim, Bae, Jang, Rhee.. (1995) (73 citations) (Correct)
Hybrid Instruction Cache Partitioning for Preemptive.. - Busquets-Mataix.. (Correct)
Threaded Prefetching: A New Instruction Memory Hierarchy for.. - Lee, al. (1997) (Correct)
Adding Instruction Cache Effect to Schedulability.. - Busquets-Mataix.. (1996) (Correct)
Compositional Static Instruction Cache Simulation - Kaustubh Patil Vmware (Correct)
Worst-Case Execution Time Analysis on Modern Processors - Nilsen, Rygg (1995) (6 citations) (Correct)
Worst Case Timing Analysis Of Concurrently Executing Dma I/o And.. - Huang (1997) (1 citation) Self-citation (Liu) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC