Efficient Tracing of Cold Code via Bias-Free Sampling

This work introduces a technique called bias-free sampling (BfS), in which the machine instructions of a dynamic execution are sampled independently of their execution frequency by using breakpoints, and the BfS overhead is independent of a program's runtime behavior and is fully predictable: it is merely a function of program size.