D. B. Kirk. Process dependent static cache partitioning for real-time systems. In Real-Time Systems Symposium, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Analytical Cache Models with Applications to Cache.. - Suh, Devadas, Rudolph (2001) (2 citations) (Correct)
....improvement by partitioning. Since each process may not need the entire cache space, the effect of context switches can be mitigated by keeping useful data in the cache over context switches. It is crucial for modern microprocessors to minimize inter process conflicts by proper cache partitioning [21, 9] or scheduling [17, 23] Our model requires information that is relatively easy to acquire. The characteristics for each process are given by the miss rate as a function of cache size when the process is isolated, which can be easily obtained either on line or offline. The time quantum for each ....
D. B. Kirk. Process dependent static cache partitioning for real-time systems. In Real-Time Systems Symposium, 1988.
Allocation of Multirate Systems on Multiprocessors with Memory.. - Li, Wolf (1997) (1 citation) (Correct)
....tasks Figure 1: Problem specification. of tens or hundreds of design points. When preemption is factored in, such models would become even more expensive. In addition, some of the tasks may not have been fully implemented, making it possible to run path based analysis. Kirk and Strosnider [5] developed a SMART (strategic memory allocation for real time) cache design that partition the cache to provide predictable cache performance even with preemption. Their algorithm targets a uniprocessor one level cache architecture and requires to modify the cache design in hardware (which is not ....
D. Kirk and J. Strosnider, "Process dependent static cache partitioning for real-time systems," in Proceedings, 9th Real-time Systems Symposium,, IEEE 1988.
An Accurate Worst Case Timing Analysis Technique for RISC.. - Sung-Soo Lim (1994) (25 citations) (Correct)
....This type of cache misses cannot be avoided in real time systems with preemptive scheduling of tasks and results in a wide variation in task execution times. This execution time variation can be eliminated by partitioning the cache and dedicating one or more partitions to each real time task [14, 15]. This cache partitioning approach eliminates the cache unpredictability caused by task preemption. However, it still suffers from the cache unpredictability caused by intratask interference that will be explained next. Intra task interference in caches occurs when more than one memory block of ....
D. B. Kirk. Process Dependent Static Cache Partitioning for Real-Time Systems. In Proceedings of the 9th Real-Time Systems Symposium, pages 181--190, 1988.
An Accurate Instruction Cache Analysis Technique for.. - Lim, Min, Lee, Park, .. (1994) (4 citations) (Correct)
....type of cache misses cannot be avoided in real time systems with preemptive scheduling of tasks and results in a wide variation in task execution times. This variation in task execution times can be eliminated by partitioning the cache and dedicating one or more partitions to each real time task[6, 7, 8]. This cache partitioning approach eliminates the cache unpredictability caused by task switches. However, it still suffers from the cache unpredictability caused by intra task interference that will be explained next. Intra task interference in caches occurs when a memory block 1 of a task ....
D. B. Kirk. Process dependent static cache partitioning for real-time systems. In Proceedings of the 9th Real-Time Systems Symposium, pages 181--190, 1988.
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