Utilizing dynamic data value localities in internal variables

Authors:
Shoichi Hirasawa;Kei Hiraki
Affiliations:
Graduate School of Information Science and Technology, The University of Tokyo;Graduate School of Information Science and Technology, The University of Tokyo
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 4
Cited 0

Value locality and load value prediction

Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
The Potential for Using Thread-Level Data Speculation to Facilitate Automatic Parallelization

HPCA '98 Proceedings of the 4th International Symposium on High-Performance Computer Architecture
In Search of Speculative Thread-Level Parallelism

PACT '99 Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques
Caching Function Results: Faster Arithmetic by Avoiding Unnecessary Computation

Caching Function Results: Faster Arithmetic by Avoiding Unnecessary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An effective approach to accelerate applications is to execute them in parallel. There are value localities in values of program variables. Data value reuse is able to enhance performance in applications by canceling same calculations. We propose the use of data value reuse and speculative parallelism with software to execute existing sequential applications in parallel. This study profiles value localities that exist in method arguments of benchmark programs, and evaluates performance improvements by applying data value reuse and speculative parallelism.