{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/92729"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/92729","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Record and replay under relaxed consistency","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Jones, Russell Llewellyn"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Vaidya, Nitin"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-11-10T17:49:55Z","date_published":"2016-11-10T17:49:55Z","updated_at":"2026-07-22T22:26:35Z","subjects":["Record and Replay","Causal Consistency","Memory Consistency","Distributed Memory","Distributed Computing"],"languages":["en"],"rights":["Copyright 2016 Russell Jones"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/92729","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Vaidya, Nitin"]},{"key":"dc:creator","label":"Author","values":["Jones, Russell Llewellyn"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016-11-10T17:49:55Z","2016-06-27","2016-08"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Record and Replay","Causal Consistency","Memory Consistency","Distributed Memory","Distributed Computing"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2016 Russell Jones"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/92729"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2016-11-09 without embargo terms","The student, Russell Jones, accepted the attached license on 2016-06-25 at 15:46.","The student, Russell Jones, submitted this Thesis for approval on 2016-06-25 at 16:21.","This Thesis was approved for publication on 2016-06-27 at 13:11.","DSpace SAF Submission Ingestion Package generated from Vireo submission #9704 on 2016-11-09 at 10:21:58","Made available in DSpace on 2016-11-10T17:49:55Z (GMT). No. of bitstreams: 2 JONES-THESIS-2016.pdf: 494890 bytes, checksum: aef8b15a6ba4542e130698d85cdbab91 (MD5) LICENSE.txt: 4210 bytes, checksum: 5f98810d49e67ee1fc24ad3859d77b4f (MD5) Previous issue date: 2016-06-27"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Record and replay under relaxed consistency"]}]}],"canonical_facts":{"dc:contributor":["Vaidya, Nitin"],"dc:creator":["Jones, Russell Llewellyn"],"dc:date":["2016-11-10T17:49:55Z","2016-06-27","2016-08"],"dc:description":["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.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2016-11-09 without embargo terms","The student, Russell Jones, accepted the attached license on 2016-06-25 at 15:46.","The student, Russell Jones, submitted this Thesis for approval on 2016-06-25 at 16:21.","This Thesis was approved for publication on 2016-06-27 at 13:11.","DSpace SAF Submission Ingestion Package generated from Vireo submission #9704 on 2016-11-09 at 10:21:58","Made available in DSpace on 2016-11-10T17:49:55Z (GMT). No. of bitstreams: 2 JONES-THESIS-2016.pdf: 494890 bytes, checksum: aef8b15a6ba4542e130698d85cdbab91 (MD5) LICENSE.txt: 4210 bytes, checksum: 5f98810d49e67ee1fc24ad3859d77b4f (MD5) Previous issue date: 2016-06-27"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/92729"],"dc:language":["en"],"dc:rights":["Copyright 2016 Russell Jones"],"dc:subject":["Record and Replay","Causal Consistency","Memory Consistency","Distributed Memory","Distributed Computing"],"dc:title":["Record and replay under relaxed consistency"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:35Z"}