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

Abstract 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.
AbstractList 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.
Author Golander, Amit
Weiss, Shlomo
Author_xml – sequence: 1
  givenname: Amit
  surname: Golander
  fullname: Golander, Amit
  email: amigos@eng.tau.ac.il
  organization: Tel Aviv University, Tel Aviv, Israel
– sequence: 2
  givenname: Shlomo
  surname: Weiss
  fullname: Weiss, Shlomo
  email: weiss@eng.tau.ac.il
  organization: Tel Aviv University, Tel Aviv, Israel
BookMark eNo1kN1KAzEQhaNWsK19Ay_2BaKTTLJJLqX4BwWl6nXI7k50bcmWzVZ8fLf-zM2B78CB-WZskrpEjF0IuBQA5soZy5GXSnIAB4orL_CILUaMI_xh6phNRSkER1TuhM3-C1QTNgUEyZ1ReMYWOX_AeChBGT1ldk30RfV-aLtUhNQUz7Slemg_qVjTPlPRpmL5TvVm17VpKJ76rqacuz6fs9MYtpkWfzlnr7c3L8t7vnq8e1her3gWzg482sqYQE5jTbKx2tXkZIhktZGiJFPFSLERQQcToTEQtdACgi1BlpWqEOdM_u7mXd-mN-p91XWb7AX4gxs_SvDox2_9jwd_cIPfMY9UPQ
ContentType Book Chapter
Copyright Springer-Verlag Berlin Heidelberg 2009
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2009
DOI 10.1007/978-3-642-00904-4_13
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISBN 9783642009044
3642009042
EISSN 1611-3349
Editor Stenström, Per
Editor_xml – sequence: 1
  givenname: Per
  surname: Stenström
  fullname: Stenström, Per
  email: per@ce.chalmers.se
EndPage 268
GroupedDBID -DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
ALMA_UNASSIGNED_HOLDINGS
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RIG
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-s198t-f8b77ae953ce2d859ce92afe857216e7bffefd1a5a7f0d70f51510a86026b4b33
ISBN 3642009034
9783642009037
ISSN 0302-9743
IngestDate Wed Nov 06 06:21:56 EST 2024
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s198t-f8b77ae953ce2d859ce92afe857216e7bffefd1a5a7f0d70f51510a86026b4b33
PageCount 27
ParticipantIDs springer_books_10_1007_978_3_642_00904_4_13
PublicationCentury 2000
PublicationDate 2009
PublicationDateYYYYMMDD 2009-01-01
PublicationDate_xml – year: 2009
  text: 2009
PublicationDecade 2000
PublicationPlace Berlin, Heidelberg
PublicationPlace_xml – name: Berlin, Heidelberg
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationTitle Transactions on High-Performance Embedded Architectures and Compilers II
PublicationYear 2009
Publisher Springer Berlin Heidelberg
Publisher_xml – name: Springer Berlin Heidelberg
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Nierstrasz, Oscar
Steffen, Bernhard
Kittler, Josef
Vardi, Moshe Y.
Weikum, Gerhard
Sudan, Madhu
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, Lancaster, UK
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, UK
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: ETH Zurich, Zurich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford University, Stanford, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: Oscar
  surname: Nierstrasz
  fullname: Nierstrasz, Oscar
  organization: University of Bern, Bern, Switzerland
– sequence: 9
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology, Madras, India
– sequence: 10
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: University of Dortmund, Dortmund, Germany
– sequence: 11
  givenname: Madhu
  surname: Sudan
  fullname: Sudan, Madhu
  organization: Massachusetts Institute of Technology, USA
– sequence: 12
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: University of California, Los Angeles, USA
– sequence: 13
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
  organization: University of California, Berkeley, USA
– sequence: 14
  givenname: Moshe Y.
  surname: Vardi
  fullname: Vardi, Moshe Y.
  organization: Rice University, Houston, USA
– sequence: 15
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max-Planck Institute of Computer Science, Saarbrücken, Germany
SSID ssj0000320475
ssj0000320474
ssj0002792
Score 1.7299513
Snippet Resource-efficient checkpoint processors have been shown to recover to an earlier safe state very fast. Yet in order to complete the misprediction recovery...
SourceID springer
SourceType Publisher
StartPage 242
SubjectTerms Arithmetic Operation
Code Segment
Execution Unit
Instruction Type
Point Benchmark
Title Reexecution and Selective Reuse in Checkpoint Processors
URI http://link.springer.com/10.1007/978-3-642-00904-4_13
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NT9wwELVaeml7oNBWLdDKB26Rq3xu4gMHhJZSBKjio-UW2clYrMomiGQlxK9nbMdJ-FAluETZKLtJ5mVfJmO_N4RscqPmDAOmZCJYjOkbk9lEsbIMkRmECArTtO_waLJ3Fu-fJ-dDTdeoS1r5o7h9UlfyElRxG-KqVbLPQLb_UdyA64gvLhFhXD5Ifu-XWYenjJUlmJK_nrHBfo90ANO5BKSV0tseDRZYS2bNAkgH1433q6-a_qwvjdLFsMV81k-H-Qsz21j95OKyntfje-wY4AaKReumNJ-Ypjp6LtIxLBpjR7JzAcW_q3pWtU6TUHfjRzpC0GwddIMYR3Vr5oZ5rs-Eo517dQn-oC7h6pLef2y7jIQk1l_2rfOLU3IhS-N7jiU-sMQ80XaLkbU3dWRrfbm653Zo2_M8eiSMZ4HgwZg-WsziXLc6fp1yZMU329P9gz99ZU63lI-7pHj4PLxUactFOzZlz1IrhtxVWKvJ0VWN1JpPncKj8XeT1px-IO-11IVqDQoGfIW8gmqVLDsAaAfAKnk3cq38SLIR7BRhpz3s1MBOZxUdYKcD7J_I2e70dGePdQ04WBPwrGUqk2kqgCdRAWGZJbwAHgoFWaItnyCVSoEqA5GIVPll6itMjgNfmLZmMpZR9JksVXUFXwjFtD4UQkbgQ4z0ILkIOJdBoiTuVkblV-K5QOT6L9Xkzk8bw5ZHOYYtN2HLddjWnrX3Onk73KAbZKm9XsA3TCVb-b3D_g4AOGnx
link.rule.ids 782,783,787,796,27938
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Transactions+on+High-Performance+Embedded+Architectures+and+Compilers+II&rft.au=Golander%2C+Amit&rft.au=Weiss%2C+Shlomo&rft.atitle=Reexecution+and+Selective+Reuse+in+Checkpoint+Processors&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2009-01-01&rft.pub=Springer+Berlin+Heidelberg&rft.isbn=9783642009037&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=242&rft.epage=268&rft_id=info:doi/10.1007%2F978-3-642-00904-4_13
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon