From: John L. <le...@mo...> - 2004-08-24 16:08:47
|
On Tue, Aug 24, 2004 at 08:21:56AM -0400, Balle, Susanne wrote: > By compression I mean that DCPI is aggregating data/reducing the amount > of data using the techniques described in the DCPI paper you have a link > to on the oprofile site. No, we don't. There is no hash-table in kernel - tests proved it to be useless compared to careful coding of the fast path. There is no aggregation of samples; however, semi-persistent data (such as the current task) is only recorded once in the sample data stream. Each on-disk sample file is stored as a persistent hash table. See the internals doc on the website for more info regards john |