J. W. Davidson and S. Jinturkar. An aggressive approach to loop unrolling. Technical Report CS-95-26, Department of Computer Science, University of Virginia, Charlottesville, June 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Resource-Bounded Partial Evaluation - Debray (6 citations) (Correct)
....to the problem at a very high level but offer few details. Many of the issues that arise in this work have been considered in the compiler optimization literature as well, albeit in considerably more restricted contexts. This includes work on function inlining [7, 12, 14, 15, 23] loop unrolling [9, 13, 16, 31], and improving cache utilization of programs [22, 25, 28] 2 Underlying Concepts We assume that the programs being specialized are expressed in a (untyped, eager) first order functional language. We will generally work with binding time annotated programs with the following abstract syntax: P 2 ....
J. W. Davidson and S. Jinturkar, "An Aggressive Approach to Loop Unrolling", Proc. Compiler Construction '96.
Improving Instruction-level Parallelism by Loop Unrolling.. - Davidson, Jinturkar (1995) (12 citations) Self-citation (Davidson Jinturkar) (Correct)
....is often referred to as instruction level parallelism or ILP. As hardware mechanisms for exploiting ILP have become more prevalent, software techniques for increasing the available ILP in programs have become increasingly important. One such code improvement technique is loop unrolling (LU) [9, 18] which in conjunction with register renaming (RR) 3, 14] can increase ILP. LU replicates the original loop body multiple times, adjusts the loop termination code and eliminates redundant branch instructions. The resulting larger basic block increases the probability that the instruction ....
....ILP. 4: Algorithms and Implementation In this section, we discuss the issues involved in implementing automatic LU, RR, and DMD. In this paper, only the high level algorithm to perform DMD is presented. Algorithms to perform LU, RR and instruction scheduling are presented in other reports [9, 10]. A portion of the high level algorithm to implement LU, RR and DMD is contained in Figure 1. RR and DMD are applied late in the optimization process, because they are applied to unrolled loops only, and LU is applied after all the traditional optimizations have been performed on the program. ....
Davidson, J. W. and Jinturkar, S., "An Aggressive Approach to Loop Unrolling", Technical Report CS-95-26, Department of Computer Science, University of Virginia, Charlottesville, June 1995.
Unrolling and Simplifying Expressions with Template Haskell - Lynagh (2003) (1 citation) (Correct)
No context found.
J. W. Davidson and S. Jinturkar. An aggressive approach to loop unrolling. Technical Report CS-95-26, Department of Computer Science, University of Virginia, Charlottesville, June 1995.
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