|
From: Bart V. A. <bar...@gm...> - 2006-08-23 19:12:14
|
On 8/22/06, Julian Seward <js...@ac...> wrote: > > > So it looks promising. At this point I have two questions: > > (1) The memory use .. seems huge. > Can you say what it is that the memory use depends on? > Is there a worst-case bound? > Can the current behaviour be improved? I have done some tests, and the huge memory consumption is probably due to a memory leak when doing segment deallocation. The memory used by drd keeps increasing for programs like konqueror or kate even although the number of segments kept in memory is limited to 16 for single-threaded programs. Even when I decreased this limit to max. 1 segment in memory at a time, memory consumption kept increasing ... (2) Nick asked: > > > What's the difference between detected and actual races? > > If the tool is to become popular we need to have a way to > explain to programmers in a simple way what it does and how > to interpret the results. I for one would like to know .. at > the moment all I know is that it finds data races by some > entirely mysterious means, and gives fewer false positives > than the Eraser style algorithms. > Was my explanation comprehensible, or should I illustrate it with a picture ? BTW: thanks for the patch ! |