ACM Home Page
Please provide us with feedback. Feedback
Reconfigurable split data caches: a novel scheme for embedded systems
Full text PdfPdf (124 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2007 ACM symposium on Applied computing table of contents
Seoul, Korea
SESSION: Embedded systems: applications, solutions, and techniques table of contents
Pages: 707 - 712  
Year of Publication: 2007
ISBN:1-59593-480-4
Authors
Afrin Naz  University of North Texas, Denton, TX
Krishna Kavi  University of North Texas, Denton, TX
JungHwan Oh  University of North Texas, Denton, TX
Pierfrancesco Foglia  University of Pisa, Diotisalvi, Italy
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 50,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1244002.1244160
What is a DOI?

ABSTRACT

This paper shows that even very small reconfigurable data caches, when split to serve data streams exhibiting temporal and spatial localities, can improve performance of embedded applications without consuming excessive silicon real estate or power. It also shows that neither higher set-associativities nor large block sizes are necessary with reconfigurable split cache organizations. We use benchmark programs from the MiBench suite to show that our cache organization outperforms an 8k unified data cache in terms of miss rates, access times, energy consumption and silicon area. Finally we show how the saved area can be utilized for supporting techniques for improving performance of embedded systems. Our design enables the cache to be divided into multiple partitions that can be used for different processor activities other than conventional caching. In this paper we have evaluated one of those options to support "prefetching".


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
4
 
5
 
6
D. Burger and T. M. Austin. "The SimpleScalar Tool Set, Version 2.0", Tech. Rep. CS-1342, University of Wisconsin-Madison, June 1997.
 
7
 
8
F. J. Sanchez, A. Gonzalez, and M. Valero, "Software Management of Selective and Dual Data Caches", IEEE TCCA NEWSLETTERS, March 97, pp. 3--10.
9
 
10
G. Lesartre and D. Hunt. PA-8500: The continuing evolution of the PA-8000 family. Proceedings of Compcon, 1997.
 
11
H. Albonesi, "Selective Cache Ways: On-Demand Cache Resource Allocation," Journal of Instruction Level Parallelism, May 2000.
 
12
J. A. Rivers and E. S. Davidson, "Reducing Conflicts in Direct-Mapped Caches with a Temporality based Design, Proc. 1996 International Conference.
13
 
14
 
15
16
 
17
 
18
M. Tomasko, S. Hadjiyiannis, and W. A. Najjar, "Experimental Evaluation of Array Caches", IEEE TCCA Newslatters, March 97, pp. 11--16.
19
 
20
21
22
 
23
S. J. E. Wilton and N. P. Jouppi, "CACTI: an enhanced cache access and cycle time model," IEEE Journal of Solid-State Circuits, Volume: 31 Issue: 5, May 1996, pp.677--688.
 
24
The MOSIS Service, http://www.mosis.org
 
25
V. Milutinovic, M. Tomasevic, B. Markovic, and M. Tremblay, "The Split Temporal/Spatial Cache: Initial Performance Analysis," SCIzzL-5, Mar. 1996.
 
26

Collaborative Colleagues:
Afrin Naz: colleagues
Krishna Kavi: colleagues
JungHwan Oh: colleagues
Pierfrancesco Foglia: colleagues