Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

EUROPAR
2001
Springer

favoriteEmaildiscussreport

86views Distributed And Parallel Com...» more EUROPAR 2001»

Loop-Carried Code Placement

13 years 9 months ago

Loop-Carried Code Placement

Download www.infosun.fim.uni-passau.de

Abstract. Traditional code optimization techniques treat loops as nonpredictable structures and do not consider expressions containing array accesses for optimization. We show that the polyhedron model can be used to implement code placement techniques that exploit equalities of expressions that hold between loop iterations. We also present preliminary results for a simple example.

Peter Faber, Martin Griebl, Christian Lengauer

Real-time Traffic

Code Optimization Techniques | Code Placement Techniques | Distributed And Parallel Computing | EUROPAR 2001 | Expressions Containing Array |

claim paper

Related Content

» SizeConstrained Code Placement for Cache Miss Rate Reduction

» Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management

» Swarm Intelligence for Digital Circuits Implementation on Field Programmable Gate Arrays P...

» Code and Data Placement for Embedded Processors with Scratchpad and Cache Memories

» Resource Placement in TorusBased Networks

» On whitespace and stability in physical synthesis

» Highdensity model for server allocation and placement

» Reliability of flat XORbased erasure codes on heterogeneous devices

» CacheConscious Data Placement

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	EUROPAR
Authors	Peter Faber, Martin Griebl, Christian Lengauer

Comments (0)