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