Thumbnail
Access Restriction
Subscribed

Author Chen, Yunji ♦ Zhang, Shijin ♦ Guo, Qi ♦ Li, Ling ♦ Wu, Ruiyang ♦ Chen, Tianshi
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2015
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Deterministic replay ♦ System-on-Chip ♦ Chip multiprocessor ♦ Data race ♦ Debugging ♦ Distributed system ♦ Operating system ♦ Order ♦ Parallel system
Abstract Deterministic replay is a type of emerging technique dedicated to providing deterministic executions of computer programs in the presence of nondeterministic factors. The application scopes of deterministic replay are very broad, making it an important research topic in domains such as computer architecture, operating systems, parallel computing, distributed computing, programming languages, verification, and hardware testing. In this survey, we comprehensively review existing studies on deterministic replay by introducing a taxonomy. Basically, existing deterministic replay schemes can be classified into two categories, $\textit{single-processor}$ (SP) schemes and $\textit{multiprocessor}$ (MP) schemes. By reviewing the details of these two categories of schemes respectively, we summarize and compare how existing schemes address technical issues such as log size, record slowdown, replay slowdown, implementation cost, and probe effect, which may shed some light on future studies on deterministic replay.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2015-09-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 48
Issue Number 2
Page Count 47
Starting Page 1
Ending Page 47


Open content in new tab

   Open content in new tab
Source: ACM Digital Library