Efficient Detection of Determinacy Races in Cilk Programs

被引：0
|
作者：
M. Feng
C. E. Leiserson
机构：
[1] School of Computing,
[2] National University of Singapore,undefined
[3] 10 Lower Kent Ridge Road,undefined
[4] Republic of Singapore 119260 fengmd@nus.edu.sg ,undefined
[5] MIT Laboratory for Computer Science,undefined
[6] 545 Technology Square,undefined
[7] Cambridge,undefined
[8] MA 02139,undefined
[9] USA cel@mit.edu,undefined
来源：
Theory of Computing Systems | 1999年 / 32卷
关键词：
Execution Time; Programming Language; Shared Memory; Directed Acyclic Graph; Efficient Detection;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, and they result when one thread updates a location in shared memory while another thread is concurrently accessing the location. We have implemented a provably efficient determinacy-race detector for Cilk, an algorithmic multithreaded programming language. If a Cilk program is run on a given input data set, our debugging tool, which we call the ``Nondeterminator,'' either determines at least one location in the program that is subject to a determinacy race, or else it certifies that the program is race free when run on the data set.
引用
收藏
页码：301 / 326
页数：25
相关论文
共 50 条
  • [31] Efficient detection and validation of atomicity violations in concurrent programs
    Eslamimehr, Mandi
    Lesani, Mohsen
    Edwards, George
    JOURNAL OF SYSTEMS AND SOFTWARE, 2018, 137 : 618 - 635
  • [32] A practical tool for detecting races in OpenMP programs
    Kim, YJ
    Park, MY
    Park, SH
    Jun, YK
    PARALLEL COMPUTING TECHNOLOGIES, 2005, 3606 : 321 - 330
  • [33] Message Races in Data Distribution Service Programs
    Kim, Hyun-Ji
    Ha, Ok-Kyoon
    Jun, Yong-Kee
    Park, Hee-Dong
    2015 8TH INTERNATIONAL CONFERENCE ON DATABASE THEORY AND APPLICATION (DTA), 2015, : 33 - 36
  • [34] Detecting races in relay ladder logic programs
    Aiken, A
    Fähndrich, M
    Su, ZD
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 1998, 1384 : 184 - 200
  • [35] Detecting data races in sequential programs with DIOTA
    Ronsse, M
    Maebe, J
    De Bosschere, K
    EURO-PAR 2004 PARALLEL PROCESSING, PROCEEDINGS, 2004, 3149 : 82 - 89
  • [36] A Tool for Detecting First Races in OpenMP Programs
    Kang, Mun-Hye
    Ha, Ok-Kyoon
    Jun, Sang-Woo
    Jun, Yong-Kee
    PARALLEL COMPUTING TECHNOLOGIES, PROCEEDINGS, 2009, 5698 : 299 - +
  • [37] Detecting unaffected message races in parallel programs
    Park, Mi-Young
    Jun, Yong-Kee
    ADVANCES IN GRID AND PERVASIVE COMPUTING, PROCEEDINGS, 2006, 3947 : 187 - 196
  • [38] An effective tool for debugging races in parallel programs
    Kim, DG
    Jun, YK
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 117 - 126
  • [39] Runtime Determinacy Race Detection for OpenMP Tasks
    Matar, Hassan Salehe
    Unat, Didem
    EURO-PAR 2018: PARALLEL PROCESSING, 2018, 11014 : 31 - 45
  • [40] Detecting races in Relay Ladder Logic programs
    Aiken A.
    Fähndrich M.
    Su Z.
    International Journal on Software Tools for Technology Transfer, 2000, Springer Verlag (03) : 93 - 105
12345