article thumbnail

Faster remainders when the divisor is a constant: beating compilers and libdivide

Daniel Lemire

In some instances, libdivide can even be more efficient than compilers because it uses an approach introduced by Robison (2005) where we not only use multiplications and shifts, but also an addition to avoid arithmetic overflows. We also published our benchmarks for research purposes. I make my benchmarking code available.

C++ 279
article thumbnail

The Return of the Frame Pointers

Brendan Gregg

To explain this example in more detail: The profiler periodically interrupts software execution, and for those disconnected stacks it happens to be the execution of the kernel software ("vfs*", "ext*", etc.). These partial stacks get grouped together on the left. Click here for a longer explanation.

Java 145
Insiders

Sign Up for our Newsletter

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Trending Sources

article thumbnail

SQL Server I/O Basics Chapter #2

SQL Server According to Bob

As ​​ the ​​ administrator of a SQL Server 2005 installation, ​​ you will find that ​​ visibility into ​​ the ​​ SQL Server ​​ I/O ​​ subsystem ​​ has been ​​ significantly increased.

Servers 40
article thumbnail

Data Mining Problems in Retail

Highly Scalable

Besides that, the numbers can vary greatly depending on many factors, so our goal here is just to provide a few benchmarks that give some sense of the magnitude of potential improvements. Jain, 2005. PS08] Optimal Targeting through Uplift Modeling, Portrait Software, 2008 [[link]. van Ryzin, 2005. Jannach, M. Khan and D.

Retail 152