mpm + algorithms   2

Branchfree Saturating Arithmetic
The difficulty with implementing saturated arithmetic is creating all the checks for overflow. The naive method requires several branches in the code. Since jumps tend to be slow to execute, the resulting math executes slowly. For performance, branch-free code is suggested. Another problem is that the overflow or carry flags are not directly accessible from high level languages like C. This means we may need rather complex round-about methods to determine whether or not an overflow occurred. Such code is difficult to make fast.
6 weeks ago by mpm
The Design of Approximation Algorithms
This is the companion website for the book The Design of Approximation Algorithms by David P. Williamson and David B. Shmoys
book  algorithms 
february 2015 by mpm

related tags

algorithms  book 

Copy this bookmark: