Composition-based Cache simulation for structure reorganization

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 626
  • Download : 0
Finding the best data layout has been an ultimate goal of memory optimization. Even with data access profile, heuristic algorithms are needed to reorganize data layout for better locality. The best layout could be found by running the given application with all possible data layouts and selecting the best performing layout. This approach, however, can incur too much overhead, particulary when the number of possible layouts are too many. In this paper, we present a composition-based cache simulation for structure reorganization. Instead of running all possible layouts, we simulate only the primary subsets of layouts and compose the cache misses for all layouts by summing up the cache misses of component subsets. Our experiment with the composition-based cache simulation shows that the differences in the cache misses are within 10% of the full cache simulation for 4-way and 8-way set associative caches. In addition to the cache miss estimation, our heuristic algorithm takes account of the extra instruction overhead incurred by structure reorganization. Our experiment with several structure intensive benchmarks shows the 37% reduction in the LID read misses and the 28% reduction in the L2 read misses. As a result, the execution times are also reduced by 19% on average. (C) 2010 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2010-02
Language
English
Article Type
Article
Citation

JOURNAL OF SYSTEMS ARCHITECTURE, v.56, no.2-3, pp.136 - 149

ISSN
1383-7621
DOI
10.1016/j.sysarc.2010.01.002
URI
http://hdl.handle.net/10203/100709
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0