Data-race detection in transactions-everywhere parallel programming

Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.

Bibliographic Details
Main Author: Huang, Kai, 1980-
Other Authors: Charles E. Leiserson.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2005
Subjects:
Online Access:http://hdl.handle.net/1721.1/16964
_version_ 1811095174705577984
author Huang, Kai, 1980-
author2 Charles E. Leiserson.
author_facet Charles E. Leiserson.
Huang, Kai, 1980-
author_sort Huang, Kai, 1980-
collection MIT
description Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.
first_indexed 2024-09-23T16:11:50Z
format Thesis
id mit-1721.1/16964
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T16:11:50Z
publishDate 2005
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/169642019-04-10T18:34:47Z Data-race detection in transactions-everywhere parallel programming Huang, Kai, 1980- Charles E. Leiserson. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003. Includes bibliographical references (p. 69-72). This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. This thesis studies how to perform dynamic data-race detection in programs using "transactions everywhere", a new methodology for shared-memory parallel programming. Since the conventional definition of a data race does not make sense in the transactions-everywhere methodology, this thesis develops a new definition based on a weak assumption about the correctness of the target program's parallel-control flow, which is made in the same spirit as the assumption underlying the conventional definition. This thesis proves, via a reduction from the problem of 3cnf-formula satisfiability, that data-race detection in the transactions-everywhere methodology is an NP-complete problem. In view of this result, it presents an algorithm that approximately detects data races. The algorithm never reports false negatives. When a possible data race is detected, the algorithm outputs simple information that allows the programmer to efficiently resolve the root of the problem. The algorithm requires running time that is worst-case quadratic in the size of a graph representing all the scheduling constraints in the target program. by Kai Huang. M.Eng. 2005-05-19T15:28:07Z 2005-05-19T15:28:07Z 2003 2003 Thesis http://hdl.handle.net/1721.1/16964 53448672 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 72 p. 531749 bytes 531447 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology
spellingShingle Electrical Engineering and Computer Science.
Huang, Kai, 1980-
Data-race detection in transactions-everywhere parallel programming
title Data-race detection in transactions-everywhere parallel programming
title_full Data-race detection in transactions-everywhere parallel programming
title_fullStr Data-race detection in transactions-everywhere parallel programming
title_full_unstemmed Data-race detection in transactions-everywhere parallel programming
title_short Data-race detection in transactions-everywhere parallel programming
title_sort data race detection in transactions everywhere parallel programming
topic Electrical Engineering and Computer Science.
url http://hdl.handle.net/1721.1/16964
work_keys_str_mv AT huangkai1980 dataracedetectionintransactionseverywhereparallelprogramming