A dynamic programming algorithm for cache memory partitioning for real-time systems

摘要

An algorithm for optimally partitioning two-level memory systems for deterministic, real-time performance is presented. The algorithm finds the optimal solution in polynomial time, which supports on-line reconfiguration of memory resources in response to changing requirements.