Proceedings of the 2nd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis - CODES+ISSS 2004
DOI: 10.1145/1016720.1016767
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing the memory bandwidth with loop fusion

Abstract: The memory bandwidth largely determines the performance and energy cost of embedded systems. At the compiler level, several techniques improve the memory bandwidth at the scope of a basic block, but often fail to exploit all. We propose a technique to optimize the memory bandwidth across the boundaries of a basic block. Our technique incrementally fuses loops to better use the available bandwidth. The resulting performance depends on how the data is assigned to the memories of the memory layer. At the same tim… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0
1

Year Published

2005
2005
2015
2015

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 24 publications
(18 citation statements)
references
References 22 publications
(27 reference statements)
0
17
0
1
Order By: Relevance
“…The main works in this area include loop fusion [9,13] and reversal [10]. Loop fusion enhances both temporal and spatial locality and is best used when the two loop bodies to be fused share the same array(s).…”
Section: Combination With Fusion and Reversalmentioning
confidence: 99%
See 2 more Smart Citations
“…The main works in this area include loop fusion [9,13] and reversal [10]. Loop fusion enhances both temporal and spatial locality and is best used when the two loop bodies to be fused share the same array(s).…”
Section: Combination With Fusion and Reversalmentioning
confidence: 99%
“…Loop fusion is applied recursively in order to allow more than two loops to be combined. Other details regarding the application of loop fusion and loop reversal are omitted due to the lack of space and can be found in [9,13,12].…”
Section: Optimization Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…In [46], we present a heuristic to decide which loops to combine. The input of the algorithm is an initial description of the loops, their statements and iteration domains.…”
Section: Global Schedule: Loop Morphingmentioning
confidence: 99%
“…Therefore, we have presented a decision mechanism in [72]. It pairwise fuses loops, which considers memory size, number of ports, access latency and assignment constraints.…”
Section: Loop Morphingmentioning
confidence: 99%