Process dependent static cache partitioning for real-time systems
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 181-190
- https://doi.org/10.1109/real.1988.51114
Abstract
The author investigates the use of a priori knowledge of program behavior to partition an instruction cache of size C into a static partition of size S and an LRU partition of size C-S. The value of S is task-dependent and is nonzero for most programs running on the system. Example programs are presented, and their behavior in various size caches is discussed. Cache partitions are generated and evaluated to determine the increase in cache performance and predictability. A high-level hardware design is presented that provides the desired partitioning scheme.Keywords
This publication has 9 references indexed in Scilit:
- Priority-driven, preemptive I/O controllers for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Cache memory design: An evolving art: Designers are looking to line size, degree of associativity, and virtual addresses as important parameters in speeding up the operationIEEE Spectrum, 1987
- Cache MemoriesACM Computing Surveys, 1982
- A simple linear model of demand paging performanceCommunications of the ACM, 1974
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- A study of storage partitioning using a mathematical model of localityCommunications of the ACM, 1972
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970
- The working set model for program behaviorCommunications of the ACM, 1968