|
Description
|
DTrace uses the Bob Jenkins "One-at-a-time" hashing algorithm to hash the keys in an aggregation. Whilst being an excellent algrorithm, it's additive nature can be expensive when used with large objects such as D Strings. D Strings are, by default, 256 bytes long and are often used in aggregations to store short strings such as a function or module name. Iterating over all 256 bytes to generate a hash value can be expensive and therefore introduces a non trivial probe effect. Any reduction in probe effect would be good.
See comments.
|