The Dynamic Trace Memorization Reuse Technique

Authors:
Amarildo T. da Costa;Felipe M. G. França;Eliseu M. C. Filho
Affiliations:
-;-;-
Venue:
PACT '00 Proceedings of the 2000 International Conference on Parallel Architectures and Compilation Techniques
Year:
2000

Citing 0
Cited 5

Balancing Reuse Opportunities and Performance Gains with Subblock Value Reuse

IEEE Transactions on Computers
Static strands: Safely exposing dependence chains for increasing embedded power efficiency

ACM Transactions on Embedded Computing Systems (TECS) - Special Section LCTES'05
Design and evaluation of an auto-memoization processor

PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Limits for a feasible speculative trace reuse implementation

International Journal of High Performance Systems Architecture
Minimal Multi-threading: Finding and Removing Redundant Instructions in Multi-threaded Processors

MICRO '43 Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic Trace Memorization (DTM) is a reuse technique that employs memorization tables to skip the execution of sequences of redundant instructions. For the SPECInt95 benchmark programs, DTM delivers performance improvements from 5% to 21% with an average of 9.3%. Moreover, DTM attains twice the average speedup of two other previously propose d reuse mechanisms for a subset of the SPECInt95 benchmarks.