(Enter summary)
Abstract: A large class of multimedia programs for embedded systems
manipulate data represented as dense matrices. In
this paper we revisit the classical optimization of scalar
replacement of array elements and pointer accesses; this
optimization allocates array elements to registers, reducing
memory traffic. We generalize the state-of-the-art algorithm,
by Carr and Kennedy [CK94], improving it to
handle simultaneously both conditional control-flow and
inter-iteration data reuse. Our algorithm operates... (Update)
Cited by: More
Spatial Computation - Mihai Budiu Girish (2004)
(Correct)
Inter-Iteration Scalar Replacement in the Presence of.. - Control-Flow Mihai Budiu (2004)
(Correct)
Active bibliography (related documents): More All
1.2: Inter-Iteration Scalar Replacement in the Presence of - Conditional Control-Flow Mihai
(Correct)
0.5: Adding Faster with Application Specific Early Termination - David Koes Tiberiu (2005)
(Correct)
0.3: Path-Sensitive, Value-Flow Optimizations of Programs - Bodik (1999)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
Related documents from co-citation: More All
3: Optimizing memory accesses for spatial computation
- Budiu, Goldstein - 2003
3: Efficiently Computing Static Single Assignment Form and the Control Dependence G..
- Cytron, Ferrante et al. - 1991
3: The simplescalar tool set (context) - Berger, Austin - 1997
BibTeX entry: (Update)
Mihai Budiu and Seth Copen Goldstein. Inter-iteration scalar replacement in the presence of conditional control-flow. Technical Report CMU-CS-04-103, Carnegie Mellon University, Department of Computer Science, 2004. http://citeseer.ist.psu.edu/751491.html More
@misc{ budiu04interiteration,
author = "M. Budiu and S. Goldstein",
title = "Inter-iteration scalar replacement in the presence of conditional control-flow",
text = "Mihai Budiu and Seth Copen Goldstein. Inter-iteration scalar replacement
in the presence of conditional control-flow. Technical Report CMU-CS-04-103,
Carnegie Mellon University, Department of Computer Science, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/751491.html" }
Citations (may not include all citations):
415
Efficiently computing static single assignment form and the ..
- Cytron, Ferrante et al. - 1991
158
Improving register allocation for subscripted variables
- Carr, Callahan et al. - 1990
157
Conversion of control dependence to data dependence (context) - Allen, Porterfield et al. - 1983
60
A practical data flow framework for array reference analysis..
- Duesterwald, Gupta et al. - 1993
49
Overlapped loop support in the Cydra (context) - Dehnert, Hsu et al. - 1989
47
Scalar replacement in the presence of conditional control fl..
- Carr, Kennedy - 1994
13
The SimpleScalar tool set (context) - Burger, Austin - 1997
13
Optimizing memory accesses for spatial computation
- Budiu, Goldstein - 2003
7
Partial dead code elimination using slicing transformations
- Bod, Rajiv - 1997
4
Optimizations to prevent cache penalties for the Intel Itani.. (context) - Collard, Lavery - 2003
4
An experimental evaluation of the sufficiency of scalar repl..
- Carr, Mangus et al. - 1996
4
Loadreuse analysis: Design and evaluation (context) - Bod, Rajiv et al. - 1999
4
The performance of scalar replacement on the HP
- Carr, Wu - 1995
3
Inter-iteration scalar replacement in the presence of condit..
- Budiu, Goldstein - 2004
2
and Seth Copen Goldstein (context) - Budiu, Venkataramani et al. - 2004
Documents on the same site (http://www.cs.cmu.edu/%7Ephoenix/publications.html): More
Factors Influencing the Performance of a CPU-RFU - Girish
(Correct)
HLS Support for Unconstrained Memory Accesses - Girish Venkataramani Tiberiu
(Correct)
A Progressive Register Allocator for Irregular Architectures - David Koes And
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC