Issue No. 08 - August (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.238493
<p>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.</p>
optimal partitioning; dynamic programming algorithm; cache memory partitioning; real-time systems; polynomial time; on-line reconfiguration; memory resources; buffer storage; dynamic programming; memory architecture; real-time systems.
J. Strosnider and J. Sasinowski, "A Dynamic Programming Algorithm for Cache Memory Partitioning for Real-Time Systems," in IEEE Transactions on Computers, vol. 42, no. , pp. 997-1001, 1993.