2 Jul 2001 00:32:26 -0400

Related articles |
---|

Any references for efficient division code sequences? shankar@webnexus.com (Shankar Unni) (2001-06-28) |

Re: Any references for efficient division code sequences? torbenm@diku.dk (2001-07-02) |

Re: Any references for efficient division code sequences? rv3s@cobra.cs.virginia.edu (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? kadiyala@home.com (Suresh Kadiyala) (2001-07-17) |

From: | Raja Venkateswaran <rv3s@cobra.cs.virginia.edu> |

Newsgroups: | comp.compilers |

Date: | 2 Jul 2001 00:32:26 -0400 |

Organization: | University of Virginia |

References: | 01-06-060 |

Keywords: | arithmetic |

Posted-Date: | 02 Jul 2001 00:32:26 EDT |

There is an efficient integer division method by any constant described in the

following paper.

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

--Raja

Shankar Unni <shankar@webnexus.com> 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)?*

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.