Open AccessProceedings Article
Efficient Race Condition Detection for Shared-Memory Programs with Post/Wait Synchronization.
Robert H. B. Netzer,Sanjoy Ghosh +1 more
- 01 Jan 1992
pp 242-246
53
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The Cilk++ concurrency platform
TL;DR: Cilk++ as mentioned in this paper is a runtime system for multicore processors with a runtime compiler and a racedetection tool, which allows nonlocal variables to be mitigated without lock contention or substantial code restructuring.
Efficient on-the-fly data race detection in multithreaded C++ programs
Eli Pozniansky,Assaf Schuster +1 more
- 22 Apr 2003
TL;DR: A novel testing tool, called MultiRace, which combines improved versions of Djit and Lockset - two very powerful on-the-fly algorithms for dynamic detection of apparent data races, and shows that the overheads imposed by MultiRace are often much smaller (orders of magnitude) than those obtained by other existing tools.
•Dissertation
Cilk: efficient multithreaded computing
Keith H. Randall,Charles E. Leiserson +1 more
- 01 Jan 1998
TL;DR: Borders on running time and communication are proved for a Cilk program executed on top of Backer, including all costs associated with Backer itself, which is believed to be the first of its kind in this regard.
137
Detecting data races in Cilk programs that use locks
Guang-Ien Cheng,Mingdong Feng,Charles E. Leiserson,Keith H. Randall,Andrew F. Stark +4 more
- 01 Jun 1998
TL;DR: The Nondeterminator-2’s two algorithms can verify the determinacy of a deadlock-free abelian program running on a given input, and it is proved that any “abelian” Cilk program, one whose critical sections commute, produces a determinate final state if it is deadlock free and if it generates any computation which is datarace free.
Static nonconcurrency analysis of OpenMP programs
Yuan Lin
- 01 Jun 2005
TL;DR: Determining exact concurrency is NP-hard, and is impossible for real-world programs at compile time, so this paper focuses on simple and efficient parallel programs.
References
•Book
An empirical comparison of monitoring algorithms for access anomaly detection
A. Dinning,Edith Schonberg +1 more
- 26 Aug 2011
TL;DR: A new algorithm is presented, referred to as task recycling, for detecting anomalies, and it is shown that task recycling is more efficient in terms of space requirements and often in performance.
222
An empirical comparison of monitoring algorithms for access anomaly detection
DinningA.,SchonbergE. +1 more
TL;DR: In this article, the authors discuss the disadvantages of parallel programming with shared memory and the non-deterministic behavior caused by uncoordinated access to shared variables, known as access anomalies monitoring.
•Proceedings Article
On the Complexity of Event Ordering for Shared-Memory Parallel Program Executions
Robert H. B. Netzer,Barton P. Miller +1 more
- 01 Jan 1990
TL;DR: This paper formally defines the problem of computing orderings that the execution must have exhibited or could have exhibited, and proves that computing such orderings is an intractable problem and that computing any of the could-have ordering relations is an NP-hard problem.
93
Event synchronization analysis for debugging parallel programs
Perry A. Emrath,S. Chosh,David Padua +2 more
- 01 Aug 1989
TL;DR: An algorithm is presented for automatically detecting non-determinacy in parallel programs that utilize event style synchronization instructions, using the Post, Wait, and Clear primitives.
77
Parallel program debugging with on-the-fly anomaly detection
Robert Hood,Ken Kennedy,John Mellor-Crummey +2 more
- 01 Oct 1990
TL;DR: An approach for parallel debugging that coordinates static analysis with efficient on-the-fly access anomaly detection is described, and ongoing efforts to incorporate the proposed debugging approach in the ParaScope environment are described.
72