J. E. Sasinowski and J. K. Strosnider. A dynamic programming algorithm for cache/memory partitioning for realtime systems. IEEE Transactions on Computers, 42(8):997-- 1001, Aug. 1993.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Cache Analysis Vs Static Cache Locking for Schedulability Analysis .. - Puaut (2002) (Correct)
....after a preemption. Cache partitioning and cache locking. A second class of approaches to deal with caches in real time systems is to use them in a restricted or customized manner, so as to adapt them to the needs of real time systems and schedulability analysis. Cache partitioning techniques [8, 5, 14] assign reserved portions of the cache (partitions) to certain tasks in order to guarantee that their most recently used code or data will remain in the cache while the processor executes other tasks. The dynamic behavior of the cache is kept within partitions. These techniques eliminate the ....
J. E. Sasinowski and J. K. Strosnider. A dynamic programming algorithm for cache/memory partitioning for realtime systems. IEEE Transactions on Computers, 42(8):997-- 1001, Aug. 1993.
Hybrid Instruction Cache Partitioning for.. - Busquets-Mataix.. (Correct)
....mappings on the cache for each task. This scheme also introduces delays, in this case due to insertion of branches to interconnect the relocated pieces of code [16] In addition, the access pattern of data structures must be changed in order to achieve exclusive mappings into the data cache. In [8, 18] an algorithm is presented to optimally allocate partitions to tasks for SMART (Strategic Memory Allocation for Real Time) The figure of merit of the algorithm is to reduce the overall utilization while guaranteeing schedulability. The cache is divided into S segments, and they are arranged in ....
....is very important because the difference between cache and memory speeds is getting larger since on chip caches need to match CPU speeds. In [8] it was measured that a program can run five times faster when a cache is used. However, this fact does not seem to be reflected in the examples given in [18] for the execution time of non cached tasks. In conclusion, we assume that partitioning will deliver better results if a private partition is assigned to every task, even though it may be small (depending on the cache size and the number of tasks) 3 Hybrid partitioning In [4] we showed that the ....
J. E. Sasinowski and J. K. Strosnider. "A DynamicProgramming Algorithm for Cache Memory Partitioning for Real-Time Systems". IEEE Transactions on Computers, Vol. 42, Num. 8, pages 997-1001, August 1993.
Low-Complexity Algorithms for Static Cache Locking in.. - Puaut, Decotigny (2002) (1 citation) Self-citation (Time) (Correct)
....Task partitioning and cache locking. A second class of approaches to deal with caches in real time systems is to use them in a restricted or customized manner, so as to adapt them to the needs of hard real time systems and schedulability analysis. Cache partitioning techniques (e.g. Kir89, SS93] assign reserved portions of the cache (partitions) to certain tasks in order to guarantee that their most recently used code or data will remain in the cache despite preemptions. The dynamic behavior of the cache is kept within partitions. These techniques eliminate the inter task ....
John E. Sasinowski and Jay K. Strosnider. A dynamic programming algorithm for cache/memory partitioning for real-time systems. IEEE Transactions on Computers, 42(8):997--1001, August 1993.
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