Show simple item record

dc.contributor.authorDing, Yang
dc.contributor.authorWong, Weng Fai
dc.date.accessioned2004-12-13T05:46:49Z
dc.date.available2004-12-13T05:46:49Z
dc.date.issued2005-01
dc.identifier.urihttp://hdl.handle.net/1721.1/7412
dc.description.abstractIt has been widely known that a significant part of the bits are useless or even unused during the program execution. Bit-width analysis targets at finding the minimum bits needed for each variable in the program, which ensures the execution correctness and resources saving. In this paper, we proposed a static analysis method for bit-widths in general applications, which approximates conservatively at compile time and is independent of runtime conditions. While most related work focus on integer applications, our method is also tailored and applicable to floating point variables, which could be extended to transform floating point number into fixed point numbers together with precision analysis. We used more precise representations for data value ranges of both scalar and array variables. Element level analysis is carried out for arrays. We also suggested an alternative for the standard fixed-point iterations in bi-directional range analysis. These techniques are implemented on the Trimaran compiler structure and tested on a set of benchmarks to show the results.en
dc.description.sponsorshipSingapore-MIT Alliance (SMA)en
dc.format.extent226802 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.relation.ispartofseriesComputer Science (CS);
dc.subjectBit-width analysisen
dc.subjectcompiler optimizationen
dc.subjectflow analysisen
dc.subjectrange analysisen
dc.titleBit-Width Analysis for General Applicationsen
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record