Strength Reduction of Integer Division and Modulo Operations
Name
MIT-LCS-TM-600.pdf
Size
574.57 KB
Format
Adobe PDF
Checksum (MD5)
6a4159e4aaad3276b5450655ba91302c
Author(s)
Amarasinghe, Saman
Lee, Walter
Greenwald, Ben
Date Issued
November 1999
Series/Report no.
MIT-LCS-TM-600
Abstract
Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behavior in queues using ring buffers, array address calculations in data distribution, and cache locality compiler-optimizations. Experienced application programmers, however, avoid them because they are slow. Furthermore, while advances in both hardware in both hardware and software have improved the performance of many parts of a program, few are applicable to division and modulo operations. This trend makes these operations increasingly detrimental to program performance.
Persistent DSpace Link
