.png){kind=icon}
.png){kind=icon}
Return
Locality optimization in a compiler for wireless applications
.png){kind=icon}
PRE
AI
DOI：10.1007/s10617-008-9019-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A strong need exists now for compilers of embedded systems to find effective ways of optimizing series of loop-nests. This is especially so for applications wherein the majority of the memory references occurs in the form of multi-dimensional arrays, indexed primarily with linear functions of iterators and parameterized constants. One major reason is the emergence of the new wireless standards, e.g. 802.11n, WiMAX, Bluetooth, HIPERMAN, 3GPP-LTE and WiBro, where the codes are predominantly of the type described above. These standards provide high bitrate and mobility but are also extremely power and performance hungry. For an even wider commercial applicability of these standards it is important to heavily optimize their energy consumption, so as to increase the mobile battery life time. We propose a novel solution to the multiple loop-nest optimization problem by using the concept of propagating constraints, and by splitting the problem into an access and layout locality-optimization phase, instead of adhering to the traditional split of temporal and spatial locality optimization. Experiments show that our technique leads to 47.5% reduction in external memory accesses over state-of-the-art.
Keywords:
Locality optimization
Multiple loop nests
Wireless systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
D
IF:
0.9
Papers:
9
Citations:
141