Data Race Detection for Event-Driven Parallel Runtime Systems

Simple item page
dc.contributor.advisorSarkar, Vivek
dc.creatorYu, Lechen
dc.date.accessioned2019-05-16T20:28:55Z
dc.date.available2019-05-16T20:28:55Z
dc.date.created2017-12
dc.date.issued2017-12-01
dc.date.submittedDecember 2017
dc.date.updated2019-05-16T20:28:55Z
dc.description.abstractEvent-Driven Parallel (EDP) runtime systems (or more simply, EDP runtimes) are growing in popularity in the high-performance computing area because they provide a promising foundation for new programming systems that can support heterogeneous architectures and ever-increasing hardware complexity. EDP runtimes allow the programmer to focus on program logic, such as control and data dependences, thereby enabling portability across a wide range of platforms and system configurations. However, the applications written on top of EDP runtimes remain vulnerable to data races. Existing data race detection tools either do not support the primitives in EDP runtimes, or incur intractable large overheads by failing to utilize the structural information available in event-driven programs. In this dissertation, we propose a graph-traversal based data race detection method for EDP runtimes. It introduces a reachability graph (encodes the dependences in a program), to check the happens-before relation between memory accesses. In order to reduce the time complexity for race detection, we propose a few optimizations, such as reachability cache and reversed reachability graph to avoid unnecessary graph traversals and path compression to reduce the number of steps performed for graph traversal. Based on our race detection technique, we have developed a prototype implementation for the Open Community Runtime (OCR). Our evaluation on a set of open source OCR benchmarks shows that our tool handles all OCR constructs, and that the time overhead for race detection is comparable to that of past work on race detection for more constrained (e.g., fork-join) runimes.
dc.format.mimetypeapplication/pdf
dc.identifier.citationYu, Lechen. "Data Race Detection for Event-Driven Parallel Runtime Systems." (2017) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/105521">https://hdl.handle.net/1911/105521</a>.
dc.identifier.urihttps://hdl.handle.net/1911/105521
dc.language.isoeng
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.
dc.subjectData Race Detection
dc.subjectParallel Programming
dc.subjectGraph Traversal
dc.titleData Race Detection for Event-Driven Parallel Runtime Systems
dc.typeThesis
dc.type.materialText
thesis.degree.departmentComputer Science
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelMasters
thesis.degree.majorParallel Programming
thesis.degree.nameMaster of Science
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
YU-DOCUMENT-2017.pdf
Size:
751.57 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.84 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.6 KB
Format:
Plain Text
Description:
Download
Collections
Rice University Electronic Theses and Dissertations