Abstract
Memory race recording is a key technology in deterministic multi-core replay. High hardware consumption, large log size and slow replay speed limited the application of previous memory race recording algorithms. This paper proposes a new efficient hardware memory race recording algorithm, which is implemented in chunks and logs the outcomes of memory races in a point-to-point approach. In this recording mechanism, memory race is presented in a new stricter indirect dependency, a chunk-based transitive reduction algorithm is introduced to reduce the number of memory races logged, a maximum timestamp approximation method is proposed to deal with those races evicted from cache. This new memory race recording algorithm can replay a program at production run speed, and log a smaller memory race log using smaller hardware than previous point-to-point approaches.
| Original language | English |
|---|---|
| Pages (from-to) | 2748-2754 |
| Number of pages | 7 |
| Journal | Tien Tzu Hsueh Pao/Acta Electronica Sinica |
| Volume | 39 |
| Issue number | 12 |
| State | Published - Dec 2011 |
Keywords
- Deterministic replay
- Memory race recording
- Multi-core program
Fingerprint
Dive into the research topics of 'Study on memory race recording mechanism in deterministic multi-core replay'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver