Online Data-Race Detection via Coherency Guarantees

We present the design and evaluation of an on-thefly data-race-detection technique that handles applications written for the lazy release consistent (LRC) shared memory model. We require no explicit association between synchronization and shared memory. Hence, shared accesses have to be tracked and compared at the minimum granularity of data accesses, which is typically a single word. The novel aspect of this system is that we are able to leverage information used to support the underlying memraction to perform on-the-fly data-race detection, without compiler support. Our system consists of a minimally modified version of the CVM distributed shared memory system, and instrumentationcode inserted by the ATOM code re-writer. We present an experimental evaluation of our technique by using our system to look for data races in four unaltered programs. Our system correctly foundread-writedataraces in a program that allows unsynchronized read access to a global tour bound, and a write-write ...

• Type: Conference
• Year: 1996
• Where: OSDI
• Authors: Dejan Perkovic, Peter J. Keleher
• Keywords: Distributed Shared Memory, On-thefly Data-race-detection Technique, Operating System, OSDI 1996, Shared Memory