Using Performance Bounds to Guide Code Compilation and Processor Design

Speculative Execution;Recovery-Free Value Prediction;Memory Level Parallelism;Code Size Efficiency;Code Compilation;Performance Bounds;Instruction Level Parallelism;Code Size Aware Compilation

Zhou, Huiyang ; Thomas M. Conte, Committee Chair,Gregory T. Byrd, Committee Member,Eric Rotenberg, Committee Member,S. Purushothaman Iyer, Committee Member,Zhou, Huiyang ; Thomas M. Conte ; Committee Chair ; Gregory T. Byrd ; Committee Member ; Eric Rotenberg ; Committee Member ; S. Purushothaman Iyer ; Committee Member

University:North Carolina State University

关键词: Speculative Execution;    Recovery-Free Value Prediction;    Memory Level Parallelism;    Code Size Efficiency;    Code Compilation;    Performance Bounds;    Instruction Level Parallelism;    Code Size Aware Compilation;   

Others  :  https://repository.lib.ncsu.edu/bitstream/handle/1840.16/4026/etd.pdf?sequence=1&isAllowed=y

美国|英语

来源: null

【 摘 要 】

Performance bounds represent the best achievable performance that can be delivered by target microarchitectures on specified workloads. Accurate performance bounds establish an efficient way to evaluate the performance potential of either code optimizations or architectural innovations. We advocate using performance bounds to guide code compilation. In this dissertation, we introduce a novel bound-guided approach to systematically regulate code-size related instruction level parallelism (ILP) optimizations, including tail duplication, loop unrolling, and if-conversion. Our approach is based on the notion of code size efficiency, which is defined as the ratio of ILP improvement over static code size increase. With such a notion, we (1) develop a general approach to selectively perform optimizations to maximize the ILP improvement while minimizing the cost in code size, (2) define the optimal tradeoff between ILP improvement and code size overhead, and (3) develop a heuristic to achieve this optimal tradeoff. We extend our performance bounds as well as code size efficiency to perform code-size-aware compilation for real-time applications. The profile independent performance bounds are proposed to reveal the criticality for each path in a task. Code optimizations can then focus on the critical paths (even at the cost of non-critical ones) to reduce the worst-case execution time, thereby improving the overall schedulability of the real-time system.For memory intensive applications featuring heavy pointer chasing, we develop an analytical model based on performance bounds to evaluate memory latency hiding techniques. We model the performance potential of these techniques and use the analytical results to motivate an architectural innovation, called recovery-free value prediction, to enhance memory level parallelism (MLP). The experimental results show that our proposed technique improves MLP significantly and achieves impressive speedups.