Proceedings of the 2006 Conference on Asia South Pacific Design Automation - ASP-DAC '06 2006
DOI: 10.1145/1118299.1118442
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical memory size estimation for loop fusion and loop shifting in data-dominated applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
31
0

Year Published

2006
2006
2010
2010

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(31 citation statements)
references
References 18 publications
0
31
0
Order By: Relevance
“…1). This is why, although previous models (e.g., [4], [8]) produce important dynamic energy savings as well, our model led to 20%-33% better savings than them.…”
Section: Resultsmentioning
confidence: 64%
See 1 more Smart Citation
“…1). This is why, although previous models (e.g., [4], [8]) produce important dynamic energy savings as well, our model led to 20%-33% better savings than them.…”
Section: Resultsmentioning
confidence: 64%
“…Although the reduction of the dynamic energy consumption in hierarchical memory subsystems has been addressed in the past (e.g., [4], [8]), the provided CAD solutions were based on mainly heuristic explorations of the solution space, rather than on a formal methodology. At the same time, the reduction of the static energy in the memory subsystem is a research direction only more recently addressed (e.g., [9]).…”
Section: Introductionmentioning
confidence: 99%
“…The energy-efficient assignment of signals to the on-and off-chip memories has been studied since the late nineties. These previous works focused on partitioning the signals from the application code into so-called copy candidates (since the on-chip memories were usually caches), and on the optimal selection and assignment of these to different layers into the memory hierarchy (32), (7), (18). For instance, Kandemir and Choudhary analyze and exploit the temporal locality by inserting local copies (21).…”
Section: Introductionmentioning
confidence: 99%
“…The typical assumption int A [7][4], B [9][5], C [11][6], D [13] [7] ; for ( i=0; i<=6; i++ ) // 1st loop nest for ( j=0; j<=3; j++ )…”
mentioning
confidence: 99%
“…Hu et al perform hierarchical memory size estimation, taking data reuse and memory hierarchy allocation into account [13]. Inplace mapping is not incorporated in the current version, but is indicated as part of future work.…”
mentioning
confidence: 99%