Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192) (1998)
Oct. 12, 1998 to Oct. 18, 1998
Nitzan Weinberg , Carnegie Mellon University
David Nagle , Carnegie Mellon University
Evaluating high-level language pointer-expressions can require a significant portion of the execution time and memory bandwidth in programs, especially for pointers with multiple memory accesses and address computations. Often such pointers repeatedly follow the same evaluation paths and return the same values. We present a microarchitecture technique that dynamically eliminates the execution of pointers based on results obtained from previous evaluations, without using prediction. We experiment with a benchmark set that includes continuous-speech recognition, MPEG-1 decoding, and SPECint95 ijpeg, li and go programs. Simulations of Digital Alpha 21164 microprocessor show that the eliminated pointers account for up to 11.3% of execution time, and 26% of data memory bandwidth of an entire program. Hence, the proposed microarchitecture provides substantial performance gains by significantly reducing the number of executed pointers.
pointer, pointer-expression, conditional execution, cache memory, speech recognition, sphinx, mpeg, jpeg, microprocessor, microarchitecture, temporal, spatial, value, locality, sub-expression, data reuse, dynamic, SPECint95, memory address, compiler, memory bandwidth, performance analysis
D. Nagle and N. Weinberg, "Dynamic Elimination of Pointer-Expressions," Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192)(PACT), Paris, France, 1998, pp. 142.