19 search results - page 1 / 4 » Division by Invariant Integers using Multiplication |
PLDI
1994
ACM
13 years 9 months ago
1994
ACM
Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer c...
TC
2011
12 years 12 months ago
2011
—This paper considers the problem of dividing a two-word integer by a single-word integer, together with a few extensions and applications. Due to lack of efficient division ins...
EUROPAR
1997
Springer
13 years 9 months ago
1997
Springer
We experiment with sequential and parallel versions of the Karatsuba multiplication algorithm implemented under the paclib computer algebra system on a Sequent Symmetry shared-memo...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
JSC
2011
12 years 7 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...