Extending the applicability of scalar replacement to multiple induction variables

Lecture Notes in Computer Science

Volumn 3602, Issue , 2005, Pages 455-469

  Baradaran, Nastaran ^a   Diniz, Pedro C ^a   Park, Joonseok ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE REUSABILITY; DATA REDUCTION; FIELD PROGRAMMABLE GATE ARRAYS; ITERATIVE METHODS; STORAGE ALLOCATION (COMPUTER); SYSTEMS ANALYSIS;

DATA EXTENSION; DATA REUSE ANALYSIS; MEMORY OPERATIONS; SCALAR REPLACEMENT;

PARALLEL PROCESSING SYSTEMS;

EID: 26444535704     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11532378_32     Document Type: Conference Paper

References (7)

1. B. So, M. Hall. Increasing the Applicability of Scalar Replacement. In Proc. of the Intl. Conf. on Compiler Construction (CC'04), In Lecture Notes in Computer Science (LNCS), Vol. 2985, Springer-Verlag Publishers, 2004.
2. M. Kandemir, A. Choudhary. Compiler-Directed Scratch Pad Memory Hierarchy Design and Management. In Proc. of the 2002 ACM/IEEE Design Automation Conference (DAC'02), IEEE Computer Society Press, 2002.
3. D. Bairagi, S. Pande and D. Agrawal. Framework for Containing Code Size in Limited Register Set Embedded Processors. In Proc. ACM Workshop on Languages, Compilers and Tools for Embedded Systems (LCTES 00), ACM Press, 2000.
4. W. Pugh. Counting Solutions to Presburger Formulas: How and Why. In Proc. of the ACM Conf. on Prog. Language Design and Implementation (PLDI), 1994.
5. M. Wolf and M. Lam. A Data Locality Optimization Algorithm. In Proc. of the ACM Conf. on Programming Language Design and Implementation (PLDI) 1991.
6. S. Carr, K. Kennedy. Improving the Ratio of Memory Operations to Floating-point Operations in Loops. ACM Trans. on Prog. Lang, and Syst., 16:1768-1810, 1994.
7. R. Allen, K. Kennedy. Optimizing Compilers for Modern Architectures. Morgan Kaufmann Publishers., San Francisco, 2002.