Learning Cache Replacement Policies using Register Automata
Processors are a basic unit of the computer which accomplish the mission of processing data stored in the memory. Large memories are required to process a big amount of data. Not all data is required at the same time, few data is required faster than other. For this reason, the memory is structured ...
Main Author: | Rueda Cebollero, Guillem |
---|---|
Format: | Others |
Language: | English |
Published: |
Uppsala universitet, Institutionen för informationsteknologi
2013
|
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-212677 |
Similar Items
-
Timed Automata for Modelling Caches and Pipelines
by: Franck Cassez, et al.
Published: (2015-11-01) -
Design an Adaptive Proxy Cache Replacement Policy Based Replacement Policy
by: Teng Hsuan Cheng, et al.
Published: (2001) -
Relating timed and register automata
by: Diego Figueira, et al.
Published: (2010-11-01) -
Finite Automata Implementations Considering CPU Cache
by: J. Holub
Published: (2007-01-01) -
Towards cache optimization in finite automata implementations
by: Ketcha Ngassam, Ernest
Published: (2013)