Skip to main navigation Skip to search Skip to main content

An efficient deterministic record-replay with separate dependencies

  • Suxia Zhu*
  • , Zhenzhou Ji
  • , Qing Wang
  • *Corresponding author for this work
  • School of Computer Science and Technology, Harbin Institute of Technology

Research output: Contribution to journalArticlepeer-review

Abstract

Shared-memory multithreaded programs running on chip multiprocessors (CMPs) tend to be nondeterministic. Two-phase deterministic record-replay is an effective approach to resolve this problem. This paper proposes an efficient separate memory race record-replay (SMRR) based on point-to-point logging approach. During recording, SMRR logs predecessors and successors of memory races separately and uses an optimized log entry format for each log entry, achieving small log size and low bandwidth overhead. During replay, SMRR actively produces wakeup messages to trigger stalled successors in time, achieving low communication overhead and fast replay speed. The simulation shows that SMRR writes a small memory race log for SPLASH-2 and PARSEC workloads, and has good scalability in log size. More importantly, SMRR can achieve the lowest bandwidth overhead in the recording phase, and a replay speed within 1-18% of the native execution speed without record-replay.

Original languageEnglish
Pages (from-to)175-189
Number of pages15
JournalComputers and Electrical Engineering
Volume39
Issue number2
DOIs
StatePublished - Feb 2013
Externally publishedYes

Fingerprint

Dive into the research topics of 'An efficient deterministic record-replay with separate dependencies'. Together they form a unique fingerprint.

Cite this