Record and replay under relaxed consistency

Record and Replay;Causal Consistency;Memory Consistency;Distributed Memory;Distributed Computing

Jones, Russell Llewellyn ; Vaidya ; Nitin

关键词: Record and Replay;    Causal Consistency;    Memory Consistency;    Distributed Memory;    Distributed Computing;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/92729/JONES-THESIS-2016.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

In the area of debugging parallel executions, record and replay is a technique that allows deterministic debugging even in the presence of data races. It is useful as most programmers are used to re-executing programs to find bugs.However, very little is known about how the consistency model affects record and replay. Previous work only applied to very strong consistency models, or to a specific architecture of shared memory. Very little theoretical basis has been developed for record and replay. This thesis makes three contributions:• An algorithm that records the minimum record for record and replay under causal consistency.• A demonstration that guaranteeing progress for a given replay mechanism can depend on the consistency model.• A demonstration that heterogeneous consistency record and replay is possible, that is, it is possible to record an execution on one consistency model and replay it on another.