Performance/Floating point
From HaskellWiki
m (Performance:Floating Point moved to Performance/Floating Point) |
|||
Line 2: | Line 2: | ||
== Don't use <tt>Float</tt> == |
== Don't use <tt>Float</tt> == |
||
− | <tt>Floats</tt> (probably 32-bits) are almost always a bad idea, anyway, unless you Really Know What You Are Doing. Use <tt>Double</tt>s. There's rarely a speed disadvantage—modern machines will use the same floating-point unit for both. With <tt>Double</tt>s, you are much less likely to hang yourself with numerical errors. |
+ | <tt>Floats</tt> (probably 32-bits) are almost always a bad idea, unless you Really Know What You Are Doing. Use <tt>Double</tt>s. There's rarely a speed disadvantage—modern machines will use the same floating-point unit for both. With <tt>Double</tt>s, you are much less likely to hang yourself with numerical errors. |
One time when <tt>Float</tt> might be a good idea is if you have a ''lot'' of them, say a giant array of <tt>Float</tt>s. An unboxed array of <tt>Float</tt> (see [[Performance:Arrays]]) takes up half the space in the heap compared to an unboxed array of <tt>Double</tt>. However, boxed <tt>Float</tt>s will only take up less space than boxed <tt>Double</tt>s if you are on a 32-bit machine (on a 64-bit machine, a <tt>Float</tt> still takes up 64 bits). |
One time when <tt>Float</tt> might be a good idea is if you have a ''lot'' of them, say a giant array of <tt>Float</tt>s. An unboxed array of <tt>Float</tt> (see [[Performance:Arrays]]) takes up half the space in the heap compared to an unboxed array of <tt>Double</tt>. However, boxed <tt>Float</tt>s will only take up less space than boxed <tt>Double</tt>s if you are on a 32-bit machine (on a 64-bit machine, a <tt>Float</tt> still takes up 64 bits). |
||
+ | |||
+ | == GHC-specific advice == |
||
+ | |||
+ | On x86 (and other platforms with GHC prior to version 6.4.2), use the <tt>-fexcess-precision</tt> flag to improve performance of floating-point intensive code. This will keep more intermediates in registers instead of memory, at the expense of occasional differences in results due to unpredictable rounding. See the [http://www.haskell.org/ghc/docs/latest/html/users_guide/options-optimise.html#options-f GHC documentation] for more details. |
Revision as of 09:23, 1 February 2006
Haskell Performance Resource
Constructs: Techniques: |
1 Don't use Float
Floats (probably 32-bits) are almost always a bad idea, unless you Really Know What You Are Doing. Use Doubles. There's rarely a speed disadvantage—modern machines will use the same floating-point unit for both. With Doubles, you are much less likely to hang yourself with numerical errors.
One time when Float might be a good idea is if you have a lot of them, say a giant array of Floats. An unboxed array of Float (see Performance:Arrays) takes up half the space in the heap compared to an unboxed array of Double. However, boxed Floats will only take up less space than boxed Doubles if you are on a 32-bit machine (on a 64-bit machine, a Float still takes up 64 bits).
2 GHC-specific advice
On x86 (and other platforms with GHC prior to version 6.4.2), use the -fexcess-precision flag to improve performance of floating-point intensive code. This will keep more intermediates in registers instead of memory, at the expense of occasional differences in results due to unpredictable rounding. See the GHC documentation for more details.