Reexecution and Selective Reuse in Checkpoint Processors

Resource-efficient checkpoint processors have been shown to recover to an earlier safe state very fast. Yet in order to complete the misprediction recovery they also need to reexecute the code segment between the recovered checkpoint and the mispredicted instruction. This paper evaluates two novel r...

Full description

Saved in:
Bibliographic Details
Published inTransactions on High-Performance Embedded Architectures and Compilers II pp. 242 - 268
Main Authors Golander, Amit, Weiss, Shlomo
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2009
SeriesLecture Notes in Computer Science
Subjects
Arithmetic Operation
Code Segment
Execution Unit
Instruction Type
Point Benchmark
Online AccessGet full text

Cover

More Information
Summary:Resource-efficient checkpoint processors have been shown to recover to an earlier safe state very fast. Yet in order to complete the misprediction recovery they also need to reexecute the code segment between the recovered checkpoint and the mispredicted instruction. This paper evaluates two novel reuse methods which accelerate reexecution paths by reusing the results of instructions and the outcome of branches obtained during the first run. The paper also evaluates, in the context of checkpoint processors, two other reuse methods targeting trivial and repetitive arithmetic operations. A reuse approach combining all four methods requires an area of 0.87[mm2], consumes 51.6[mW], and improves the energy-delay product by 4.8% and 11.85% for the integer and floating point benchmarks respectively.
ISBN:3642009034
9783642009037
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-00904-4_13