Record and replay under relaxed consistency

Jones, Russell Llewellyn

Permalink

https://hdl.handle.net/2142/92729 Copy

Description

Title

Record and replay under relaxed consistency

Author(s)

Jones, Russell Llewellyn

Issue Date

2016-06-27

Director of Research (if dissertation) or Advisor (if thesis)

Vaidya, Nitin

Department of Study

Electrical & Computer Eng

Discipline

Electrical & Computer Engr

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

M.S.

Degree Level

Thesis

Date of Ingest

2016-11-10T17:49:55Z

Keyword(s)

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

Abstract

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.

Graduation Semester

2016-08

Type of Resource

text

Permalink

http://hdl.handle.net/2142/92729

Copyright and License Information

Copyright 2016 Russell Jones

Owning Collections