A fast division technique for constant divisors-Reference-Cited by-同舟云学术

A fast division technique for constant divisors

Published:1976-02 Issue:2 Volume:19 Page:98-101
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Artzy Ehud¹,Hinds James A.²,Saal Harry J.³

Affiliation:

1. Everyman's Univ., St. Afeka, Israel

2. Univ. of Utah, Salt Lake City

3. IBM Israel Scientific Center, Haifa, Israel

Abstract

A fast algorithm for division by constant divisors is presented. The method has proved very useful implemented as microcode on a binary machine, and can be adapted directly into hardware. The mathematical foundations of the algorithm are presented as well as some performance measures.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/359997.360013

Reference5 articles.

1. System 360 Principles of Operation. GA22-6821 IBM Corp. 1970. System 360 Principles of Operation. GA22-6821 IBM Corp. 1970.

2. A Combinatoric Division Algorithm for Fixed-Integer Divisors

3. B1700 Systems Reference Manual. 1057155 Burroughs Corp. 1972. B1700 Systems Reference Manual. 1057155 Burroughs Corp. 1972.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Integer division by constants: optimal bounds;Heliyon;2021-06

2. Faster remainder by direct computation: Applications to compilers and software libraries;Software: Practice and Experience;2019-02-27

3. Hardware Division by Small Integer Constants;IEEE Transactions on Computers;2017-12-01

4. Asymptotic Optimality of Parallel Short Division;2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2016-05

5. Multiplication by Rational Constants;IEEE Transactions on Circuits and Systems II: Express Briefs;2012-02