[borman]

> where lowest latency is needed

Not so sure it would even be "the lowest", rather than "low enough, stable and predictable", even if it's higher on average than optimal.

For example, comparing a hashtable lookup to a BST lookup (and ignoring the memory hierarchy for the sake of example), the former would be faster on average, but the latter would produce more predictable lookup times without hiccups.