Scalable and Precise Dynamic Datarace Detection for Structured Parallelism

Simple item page
dc.contributor.authorRaman, Raghavanen_US
dc.contributor.authorZhao, Jishengen_US
dc.contributor.authorSarkar, Viveken_US
dc.contributor.authorVechev, Martinen_US
dc.contributor.authorYahav , Eranen_US
dc.date.accessioned2017-08-02T22:03:11Zen_US
dc.date.available2017-08-02T22:03:11Zen_US
dc.date.issued2012-07-06en_US
dc.date.noteJuly 6, 2012en_US
dc.description.abstractExisting dynamic race detectors suffer from at least one of the following three limitations: i) space overhead per memory location grows linearly with the number of parallel threads [13], severely limiting the parallelism that the algorithm can handle. (ii) sequentialization: the parallel program must be processed in a sequential order, usually depth-first [12, 24]. This prevents the analysis from scaling with available hardware parallelism, inherently limiting its performance. (iii) inefficiency: even though race detectors with good theoretical complexity exist, they do not admit efficient implementations and are unsuitable for practical use [4, 18]. We present a new precise dynamic race detector that leverages structured parallelism in order to address these limitations. Our algorithm requires constant space per memory location, works in parallel, and is efficient in practice. We implemented and evaluated our algorithm on a set of 15 benchmarks. Our experimental results indicate an average (geometric mean) slowdown of 2.78× on a 16core SMP system.en_US
dc.format.extent14 ppen_US
dc.identifier.citationRaman, Raghavan, Zhao, Jisheng, Sarkar, Vivek, et al.. "Scalable and Precise Dynamic Datarace Detection for Structured Parallelism." (2012) https://hdl.handle.net/1911/96401.en_US
dc.identifier.digitalTR12-01en_US
dc.identifier.urihttps://hdl.handle.net/1911/96401en_US
dc.language.isoengen_US
dc.rightsYou are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).en_US
dc.titleScalable and Precise Dynamic Datarace Detection for Structured Parallelismen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR12-01.pdf
Size:
403.86 KB
Format:
Adobe Portable Document Format
Download
Collections
Computer Science Technical Reports