On Dec 5, 2007 1:19 PM, Julian Seward <[EMAIL PROTECTED]> wrote: > > > DRD on the other hand looks for possible causes of > > nondeterminism. There are no such issues in the program cv.cc, hence DRD > > does not complain on any of the COND accesses in cv.cc. > > Yes. > > So I have a question: can you clarify what you mean by "possible causes > of nondeterminism"? I have the impression that DRD-style algorithms are > scheduling-sensitive, whereas Helgrind is not (or at least, less so). > > J >
If DRD reports a data race, this means that it found conflicting accesses whose order was not defined by synchronization primitives. Such conflicting accesses make the execution of a multithreaded program nondeterministic. And it is right that Helgrind is less sensitive to thread scheduling, and that a pure vector clock based race detector can miss some data races. But the better detection of Helgrind has its price: it runs considerably slower than DRD. It would also be interesting to know how big the chance is that a data race is missed by the vector clock algorithm but that it is detected by the Eraser algorithm. Regards, Bart. ------------------------------------------------------------------------- SF.Net email is sponsored by: The Future of Linux Business White Paper from Novell. From the desktop to the data center, Linux is going mainstream. Let it simplify your IT future. http://altfarm.mediaplex.com/ad/ck/8857-50307-18918-4 _______________________________________________ Valgrind-developers mailing list Valgrind-developers@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/valgrind-developers
