Remove 2005 Remove Availability Remove Benchmarking Remove Software
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

Copyright The information ​​ that is contained ​​ in this document represents the current view of Microsoft Corporation on the issues discussed as of the date of publication.

Servers 40
article thumbnail

Data Mining Problems in Retail

Highly Scalable

This approach can be expressed in more formal way by the following equation: where is the data available for analysis, is the space of a retailer’s actions and decisions, is an econometric model defined as a function of actions and data, and is the optimal strategy. This framework resembles the approach suggested in [JK98].

Retail 152