Much of the past work on dynamic data-race and determinacy-race detection algorithms for task parallelism has focused on structured parallelism with fork-join constructs and, more recently, with future constructs. This paper addresses the problem of dynamic detection of data-races and determinacy-races in task-parallel programs with promises, which are more general than fork-join constructs and futures. We have introduced a dynamic data race detector, DRDP, to help examine task-parallelism programs with promises. DRDP is designed for the HCLIB parallel programming model and capable of pinpointing data races in a HCLIB program. In this artifact, we provide the race detector implementation and all benchmarks to help reproduce the reported results in the paper.
@Article{jin_et_al:DARTS.9.2.24, author = {Jin, Feiyang and Yu, Lechen}, title = {{Determinacy Race Detector for Promises (Artifact)}}, pages = {24:1--24:2}, journal = {Dagstuhl Artifacts Series}, ISSN = {2509-8195}, year = {2023}, volume = {9}, number = {2}, editor = {Jin, Feiyang and Yu, Lechen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.9.2.24}, URN = {urn:nbn:de:0030-drops-182649}, doi = {10.4230/DARTS.9.2.24}, annote = {Keywords: Race detection, Promise, Determinism, Determinacy-race} }
a683aa51c2cd00b05cc1b941327713ae
(Get MD5 Sum)
The artifact has been evaluated as described in the ECOOP 2023 Call for Artifacts and the ACM Artifact Review and Badging Policy
Feedback for Dagstuhl Publishing