S. Carr, D. Callahan, and K. Kennedy. Improving register allocation for subscripted variables. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), White Plains NY, June 1990. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Algorithms for Array Reference Allocation in Loops of.. - Ottoni, Araujo (2002) (Correct)
....minimized. LARA has been studied in [20, 4, 16] which are ecient graph based solutions, when references are restricted to basic block boundaries. Global register allocation for array references, on general purpose architectures, has been studied before by Bodik and Gupta [6] and Callahan et al. [9]. In [6] and [9] array references are allocated to general purpose registers. As the loop iteration progresses, references are moved among registers in a pipelined fashion. Unfortunately, many embedded processors are highly constrained architectures containing very few specialized registers, what ....
....has been studied in [20, 4, 16] which are ecient graph based solutions, when references are restricted to basic block boundaries. Global register allocation for array references, on general purpose architectures, has been studied before by Bodik and Gupta [6] and Callahan et al. [9] In [6] and [9] array references are allocated to general purpose registers. As the loop iteration progresses, references are moved among registers in a pipelined fashion. Unfortunately, many embedded processors are highly constrained architectures containing very few specialized registers, what makes the ....
[Article contains additional citation context not shown here]
D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In ACM SIGPLAN Conference on Programming Languages Design and Implementation, pages 53-65, June 1990.
Scalable I/O for Out-of-Core Structures - Paleczny, al. (1993) (Correct)
....and Communication Balance. Callahan, Cocke, and Kennedy [4] pioneered balancing the amount of computation and communication done inside a loop nest with the capabilities of the target machine. Later, a specific transformation, scalar replacement, was successfully applied to scientific codes [3] to improve balance. This optimization allows the compiler to main tain array data in registers instead of cache, reducing latency for accesses to this data. We hope to use static performance estimation along with our out of core transformations to identify regions of code where the balance ....
D. Callahan, S. Cart, and K. Kennedy. Improving register allocation for subscripted variables. In Proceedings of the SIGPLAN '90 Conference on Program Language Design and Implementation, White Plains, NY, June 1990.
Operator Strength Reduction - Cooper, Simpson, Vick (1995) (3 citations) (Correct)
....reassociation [17, 41, 5] strength reduction may let the compiler use fewer induction variables in a loop, lowering both the operation count inside the loop and the demand for registers. This effect may be especially pronounced in code that has been automatically blocked to improve locality [48, 11]. The next section summarizes prior work on strength reduction, and places the new algorithm in that context. We follow that section with a deeper introduction to strength reduction, given through a more detailed description of the ack algorithm. Section 4 presents our new algorithm and its ....
D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. SIGPLAN Notices, 25(6):53--65, June 1990. Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation.
A Blocked All-Pairs Shortest-Paths Algorithm - Gayathri Venkataraman Sartaj (Correct)
....L1 miss rate x (L2 hit time L2 miss rate x L2 miss penalty) 11) We may obtain a lower bound for the L1 and L2 miss rate by determining the minimum number of L1 and L2 misses that every reorganized version of Figure 1 must make. Since we intend to declare i, j, k, and n as register variables [8], references to these variables do not access cache and so do not cause any cache misses. Therefore, we focus on cache misses attributable to the array A. For our analysis we use the cache characteristics of the Sun Enterprise 4000 5000 that are shown in Table 2. By direct mapped we mean that each ....
D. Callahan, S. Cart, and K. Kennedy. Improving register allocation for subscripted variables. In In Proceedings of the A CM SIGPLAN '90 Conference on Programming Language Design and Implementation, White Plains, New York, 1990.
An Integrated Approach for Improving Cache Behavior - Memik, Kandemir, Choudhary, .. (Correct)
....framework was readily available to us. It should be noted, however, that other locality optimization approaches such as [12] would result in similar output codes for the regular, array based programs in our experimental suite. The second step is fairly standard and its details can be found in [4]. A brief summary of this compiler optimization strategy follows. Consider the following loop nest: for(i=1;i =N;i ) for(j=1;j =N;j ) U[j] V[j] i] W[i] j] The approach detects that the loop j (and consequently the loop i) can be optimized by the compiler. Informally, the approach ....
D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proc. SIGPLAN Conference on Programming Language Design and Implementation, ACM, New York.
Space-Time Trade-Off Optimization for a Class of.. - Cociorva.. (2002) (1 citation) (Correct)
....will be repeatedly needed, to avoid re computation. They considered loop fusion without any loop reordering; and their work is not aimed at minimizing array sizes. Lewis et al. 20] discusses the application of fusion directly to array statements in languages such as F90 and ZPL. Callahan et al. [2] present a technique to convert array references to scalar accesses in innermost loops. There has been some recent work on using loop fusion for memory reduction for sequential execution. Fraboulet et al. 7] use loop alignment to reduce memory requirement between adjacent loops by formulating ....
D. Callahan, S.Carr, and K. Kennedy. Improving register allocation for subscripted variables. In SIGPLAN Conference on Programming Language Design and Implementation, White Plains, NY, June 1990.
Global Communication Optimization for - Tensor Contraction Expressions (Correct)
....programs has been discussed by Guibas and Wyatt [7] They considered loop fusion without any loop reordering; and their work is not aimed at minimizing array sizes. Lewis et al. 18] discusses the application of fusion directly to array statements in languages such as F90 and ZPL. Callahan et al. [1] present a technique to convert array references to scalar accesses in innermost loops. As mentioned earlier, loop fusion has also been used as a means of improving data locality [11, 24, 22, 21] There has been much less work investigating the use of loop fusion as a means of reducing memory ....
D. Callahan, S.Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proc. SIGPLAN '90 Conference on Programming Language Design and Implementation, White Plains, NY, June 1990.
Loop Transformations for Architectures with Partitioned.. - Huang, Carr, al. (2001) Self-citation (Carr) (Correct)
No context found.
D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In pages 53-65, White Plains, NY, June 1990.
Low-cost Register-pressure Prediction for Scalar Replacement.. - Ma, Carr, Ge Self-citation (Carr) (Correct)
No context found.
D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proceedings of the ACM SIGPLAN 1999.
Improving Software Pipelining By Hiding Memory Latency With.. - Bedy, al. Self-citation (Carr) (Correct)
No context found.
David Callahan, Steve Carr, and Ken Kennedy. Improving register allocation for subscripted variables. In Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, pages 53--65, White Plains, NY, June 1990.
Scalar Replacement in the Presence of Conditional Control Flow - Carr, Kennedy (1992) (27 citations) Self-citation (Carr Kennedy) (Correct)
No context found.
David Callahan, Steve Carr, and Ken Kennedy. Improving register allocation for subscripted variables. SIGPLAN Notices, 25(6):53-65, June 1990. Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation.
Scalar Replacement in the Presence of Conditional Control Flow - Carr, Kennedy (1992) (27 citations) Self-citation (Carr Kennedy) (Correct)
No context found.
David Callahan, Steve Carr and Ken Kennedy, `Improving register allocation for subscripted variables', SIGPLAN Notices, 25, (6), 53--65 (1990). Proc. ACM SIGPLAN '90 Conference on Programming Language Design and Implementation.
Inter-Iteration Scalar Replacement in the Presence of.. - Control-Flow Mihai Budiu (2004) (Correct)
No context found.
S. Carr, D. Callahan, and K. Kennedy. Improving register allocation for subscripted variables. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), White Plains NY, June 1990.
Is Search Really Necessary to Generate High-Performance .. - Yotov, Li, Ren.. (2005) (Correct)
No context found.
D. Callahan, S. Carr, and K. Kennedy, "Improving register allocation for subscripted variables," in Proc. SIGPLAN Conf. Programming Language Design and Implementation, 1990, pp. 53--65.
Analytic Models and Empirical Search: A Hybrid.. - Epshteyn.. (2005) (Correct)
No context found.
D. Callahan, S. Carr, and K. Kennedy. Improving Register Allocation for Subscripted Variables. In Proc. of PLDI, pages 53--65, 1990.
Power-Aware Compilation Techniques for High Performance Processors - Yang (2004) (Correct)
No context found.
David Callahan, Steve Carr, and Ken Kennedy. Improving register allocation for subscripted variables. In Proceedings of the SIGPLAN pages 53--65, White Plains, New York, June 20--22, 1990. SIGPLAN Notices, 25(6), June 1990.
Inter-Iteration Scalar Replacement in the Presence of - Conditional Control-Flow Mihai (2004) (Correct)
No context found.
S. Carr, D. Callahan, and K. Kennedy. Improving register allocation for subscripted variables. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), White Plains NY, June 1990.
Compiler-Assisted Cache Replacement: Problem.. - Yang, Govindarajan.. (2003) (3 citations) (Correct)
No context found.
David Callahan, Steve Carr, and Ken Kennedy. Improving register allocation for subscripted variables. In Proc. of SIGPLAN PLDI '90, pages 53--65, White Plains, N. Y., Jun. 1990.
Memory Redundancy Elimination to Improve Application Energy.. - Cooper, Xu (2003) (1 citation) (Correct)
No context found.
D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. pages 53--65. 1990 ACM SIGPLAN PLDIConference on Programming Language Design and Implementation.
Optimizing Sparse Matrix-Vector Product Computations.. - Mellor-Crummey, Garvin (2003) (Correct)
No context found.
D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation, White Plains, NY, June 1990.
Instruction Balance, Energy Consumption and Program Performance - Li, Ding (2001) (Correct)
No context found.
D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation, White Plains, NY, June 1990.
Inter-Iteration Scalar Replacement in the Presence of - Conditional Control-Flow Mihai (Correct)
No context found.
S. Carr, D. Callahan, and K. Kennedy. Improving register allocation for subscripted variables. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), White Plains NY, June 1990.
Compiler-Assisted Cache Replacement: Problem.. - Yang, Govindarajan.. (2003) (3 citations) (Correct)
No context found.
David Callahan, Steve Carr, and Ken Kennedy. Improving register allocation for subscripted variables. In Proc. of SIGPLAN PLDI '90, pages 53--65, White Plains, N. Y., Jun. 1990.
Space-Time Trade-Off Optimization for a Class of - Electronic Structure.. (Correct)
No context found.
D. Callahan, S.Carr, and K. Kennedy. Improving register allocation for subscripted variables. In SIGPLAN Conference on Programming Language Design and Implementation, White Plains, NY, June 1990.
A Compiler Approach to Fast Hardware Design Space Exploration .. - So, Hall, Diniz (2002) (3 citations) (Correct)
No context found.
D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proc. of the ACM Conference on Program Language Design and Implementation (PLDI'90), pages 53--65, 1990.
First 50 documents Next 50
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