BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Performance Optimizations for Compiler-based Error Detection Metho
 dologies - Konstantina Mitropoulou\, University of Edinburgh
DTSTART:20140325T100000Z
DTEND:20140325T110000Z
UID:TALK51553@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Compiler-based error detection methodologies replicate the ins
 tructions of the program and insert checks wherever it is needed. The chec
 ks evaluate code correctness and decide whether or not an error has occurr
 ed. The replicated instructions and the checks cause a large slow-down. In
  this work\, we focus on reducing the error detection overhead and improvi
 ng the system’s performance without degrading fault-coverage. The propos
 ed technique (DRIFT) achieves this by decoupling the execution of the code
  original and replicated) from the checks.\n\nThe checks are compare and j
 ump instructions. The latter ones sequentialize the code and prohibit the 
 compiler from performing aggressive instruction scheduling optimizations. 
 We call this phenomenon basic-block fragmentation. DRIFT reduces the impac
 t of basic-block fragmentation by breaking the \n synchronized execute-che
 ck-confirm-execute cycle. In this way\, DRIFT generates a scheduler-friend
 ly code with more ILP.  As a result\, it reduces the performance overhead 
 down to 1.29× (on average) and outperforms the state-of-the-art by up to 
 29.7% retaining the same fault-coverage. The evaluation was done on an Ita
 nium2 by running MediabenchII and SPEC2000 benchmark suites.
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR