ScholarLens Back to search
2018•Unpublished venueRequires access

A Quick Deterministic Replay Method Based on Dependence Pair

Ying Huan, Miao Si-Wei, Lifang Han, Yu Wen-Hao, Liang Zhou

Open publisher page 0 citations

Abstract

Deterministic replay plays an important role for parallel program debugging. Related work focused on how to efficiently record undeterminstic events in parallel programs, while ignored poor performance in replay-runs. This paper proposes a quick deterministic replay method based on dependence pair to acquire excellent performance in replay-runs. It conducts offline analysis for record log file to recognize the record items with dependency relationship based on topological graph, and each thread only executes these record items in order in replay-runs. Performance evaluation shows that this method gets better performance in replay-runs than traditional serial replay method.

About this research paper

What this paper is about

Deterministic replay plays an important role for parallel program debugging. Related work focused on how to efficiently record undeterminstic events in parallel programs, while ignored poor performance in replay-runs. This paper proposes a quick deterministic replay method based on dependence pair to acquire excellent performance in replay-runs. It conducts offline analysis for record log file to recognize the record items with dependency relationship based on topological graph, and each thread only executes these record items in order in replay-runs. Performance evaluation shows that this method gets better performance in replay-runs than traditional serial replay method.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Deterministic replay plays an important role for parallel program debugging. Related work focused on how to efficiently record undeterminstic events in parallel programs, while ignored poor performance in replay-runs. This paper proposes a quick deterministic replay method based on dependence pair to acquire excellent performance in replay-runs. It conducts offline analysis for record log file to recognize the record items with dependency relationship based on topological graph, and each thread only executes these record items in order in replay-runs. Performance evaluation shows that this method gets better performance in replay-runs than traditional serial replay method.

Key concepts: Computer science, Debugging, Thread (computing), Dependency graph, Dependency (UML), Graph, Parallel computing, Theoretical computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Quick Deterministic Replay Method Based on Dependence Pair — Research Paper | ScholarLens