|Any references for efficient division code sequences? email@example.com (Shankar Unni) (2001-06-28)|
|Re: Any references for efficient division code sequences? firstname.lastname@example.org (2001-07-02)|
|Re: Any references for efficient division code sequences? email@example.com (Raja Venkateswaran) (2001-07-02)|
|Re: Any references for efficient division code sequences? David.Chase@naturalbridge.com (David Chase) (2001-07-03)|
|Re: Any references for efficient division code sequences? firstname.lastname@example.org (Suresh Kadiyala) (2001-07-17)|
|From:||Raja Venkateswaran <email@example.com>|
|Date:||2 Jul 2001 00:32:26 -0400|
|Organization:||University of Virginia|
|Posted-Date:||02 Jul 2001 00:32:26 EDT|
There is an efficient integer division method by any constant described in the
R. Alverson. Integer Division Using Reciprocals. In 10th Symposium on Computer
Arithmetic, pages 186--190, 1991.
Most of the computation is done at compile time (generation of constants used
by the algorithm). At run-time, you would have about 5-6 instrns. The
algorithm is fairly simple to implement
Shankar Unni <firstname.lastname@example.org> writes:
> Are there any references that discuss code sequences for dividing (or
> specifically in our case, remaindering) integers by small constants (for
> any processor that doesn't have a MUL/DIV unit)?
Return to the
Search the comp.compilers archives again.