DocumentCode :
958500
Title :
A dynamic programming algorithm for cache memory partitioning for real-time systems
Author :
Sasinowski, John E. ; Strosnider, Jay K.
Author_Institution :
Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA
Volume :
42
Issue :
8
fYear :
1993
fDate :
8/1/1993 12:00:00 AM
Firstpage :
997
Lastpage :
1001
Abstract :
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
Keywords :
buffer storage; dynamic programming; memory architecture; real-time systems; cache memory partitioning; dynamic programming algorithm; memory resources; on-line reconfiguration; optimal partitioning; polynomial time; real-time systems; Cache memory; Costs; Dynamic programming; Engines; Heuristic algorithms; Partitioning algorithms; Polynomials; Processor scheduling; Random access memory; Real time systems;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.238493
Filename :
238493
Link To Document :
بازگشت