Widening Integer Arithmetic
View/ Open
Metadata
Show full item recordCitation
Redwine, Kevin and Norman Ramsey. 2004. Widening Integer Arithmetic. Harvard Computer Science Group Technical Report TR-01-04.Abstract
Some codes require computations to use fewer bits of precision than are normal for the target machine. For example, Java requires 32-bit arithmetic even on a 64-bit target. To run narrow codes on a wide target machine, we present a widening transformation. Almost every narrow operation can be widened by sign- or zero-extending the operands and using a target-machine instruction at its natural width. But extensions can be sometimes avoided, and our transformation avoids as many as possible. The key idea is knowing what each operation can accept in the high bits of its arguments and what it can guarantee about the high bits of its result. This knowledge is formalized using fill types, which drive the widening transformation.Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAACitable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:23017123
Collections
- FAS Scholarly Articles [18281]
Contact administrator regarding this item (to report mistakes or request changes)