Premium
Compiler support for floating‐point computation
Author(s) -
Farnum Charles
Publication year - 1988
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380180709
Subject(s) - compiler , predictability , computer science , computation , floating point , optimizing compiler , code (set theory) , parallel computing , point (geometry) , code generation , programming language , operating system , key (lock) , mathematics , statistics , geometry , set (abstract data type)
Predictability is a basic requirement for compilers of floating‐point code—it must be possible to determine the exact floating‐point operations that will be executed for a particular source‐level construction. Experience shows that many compilers fail to provide predictability, either because of an inadequate understanding of its importance or from an attempt to produce locally better code. Predictability can be attained through careful attention to code generation and a knowledge of the common pitfalls. Most language standards do not completely define the precision of floating‐point operations, and so a good compiler must also make a good choice in assigning precisions of subexpression computation. Choosing the widest precision that will be used in the expression usually gives the best trade‐off between efficiency and accuracy. Finally, certain optimizations are particularly useful for floating‐point and should be included in a compiler aimed at scientific computation. But predictability is more important than efficiency; obtaining incorrect answers fast helps no one.