Fast Constant Division Routines
IEEE Transactions on Computers
Multiplication by Integer constants
Software—Practice & Experience
Integer multiplication and division on the HP precision architecture
ASPLOS II Proceedings of the second international conference on Architectual support for programming languages and operating systems
MIPS RISC architecture
The IBM RISC System/6000 processor: hardware overview
IBM Journal of Research and Development
MC68020 32-BIT microprocessor user's manual
MC68020 32-BIT microprocessor user's manual
The SPARC architecture manual: version 8
The SPARC architecture manual: version 8
The Euclidean definition of the functions div and mod
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing A*B (mod N) efficiently in ANSI C
ACM SIGPLAN Notices
A fast division technique for constant divisors
Communications of the ACM
A note on the MODULO operation
ACM SIGPLAN Notices
DCG: an efficient, retargetable dynamic code generation system
ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
C: a language for high-level, efficient, and machine-independent dynamic code generation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Instruction combining for coalescing memory accesses using global code motion
MSP '04 Proceedings of the 2004 workshop on Memory system performance
Division by integers using multiplication: nifty assignment
Journal of Computing Sciences in Colleges
On Faster Integer Calculations Using Non-arithmetic Primitives
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
SSE Implementation of Multivariate PKCs on Modern x86 CPUs
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Efficient and formally proven reduction of large integers by small moduli
ACM Transactions on Mathematical Software (TOMS)
Strength reduction of integer division and modulo operations
LCPC'01 Proceedings of the 14th international conference on Languages and compilers for parallel computing
Compiler-directed leakage reduction in embedded microprocessors
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Code density concerns for new architectures
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Generic design of Chinese remaindering schemes
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
A convolve-and-merge approach for exact computations on high-performance reconfigurable computers
International Journal of Reconfigurable Computing - Special issue on High-Performance Reconfigurable Computing
| Hi-index | 0.00 |
Integer division remains expensive on today's processors as thecost of integer multiplication declines. We present code sequences fordivision by arbitrary nonzero integer constants and run-time invariantsusing integer multiplication. The algorithms assume a two's complementarchitecture. Most also require that the upper half of an integerproduct be quickly accessible. We treat unsigned division, signeddivision where the quotient rounds towards zero, signed division wherethe quotient rounds towards -∞, and division where the result is knowna priori to be exact. We give someimplementation results using the C compiler GCC.