DocumentCode :
3004962
Title :
Replacement policies for scratch pad memory in embedded systems
Author :
Mittal, Shaily ; Nitin, Nitin
Author_Institution :
Dept. of Comput. Sci., ITM Gurgaon, Gurgaon, India
fYear :
2011
fDate :
21-24 Nov. 2011
Firstpage :
159
Lastpage :
163
Abstract :
The incredible rise in microprocessor technology has presented high speed processors and has improved the processor-memory speed gap dramatically. As a result, the design of on chip memory hierarchy is a significant issue in embedded systems. This paper describes a simulation based performance evaluation of typical cache vs. scratch-pad memory (SPM) design issues in embedded systems such as associativity and replacement policy. This evaluation is done using SimpleScalar simulation tools. Moreover, we propose the use of three replacement policies in SPM and assess the best approach for replacement in SPM for embedded systems. According to our simulation results, LRU replacement approach in SPM effectively decreases the data miss ratio of the cache. Comparisons against a SPM solution show remarkable advantages between 18% and 61% in cache miss rate for designs of the same memory size.
Keywords :
cache storage; digital simulation; embedded systems; performance evaluation; random-access storage; LRU replacement approach; associativity; cache memory; embedded systems; high speed processors; microprocessor technology; on chip memory hierarchy; processor-memory speed gap; replacement policies; scratch pad memory; simulation based performance evaluation; Benchmark testing; Cache memory; Embedded systems; Memory management; Performance evaluation; Program processors; Resource management; FIFO; LRU; Random; SPM;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON 2011 - 2011 IEEE Region 10 Conference
Conference_Location :
Bali
ISSN :
2159-3442
Print_ISBN :
978-1-4577-0256-3
Type :
conf
DOI :
10.1109/TENCON.2011.6129083
Filename :
6129083
Link To Document :
بازگشت