title: Does IEEE floating-point arithmetic calculation time depend on value?
body: <p>I am using IEEE strict floating point arithmetic in a CFD solver. My algorithm is explicit and deterministic (it will perform the exact same number of computations at each time step). Yet I am observing that during periods when solution is...complicated (lots of stuff happening all over the grid), the solver "bogs down" and goes slower.</p>
  
  <p>I'm very n00bish to FP arithmetic, and therefore assumed that FP arithmetic was deterministic in its computation time. Now I'm beginning to wonder if there the number of actual CPU operations required for a given FP calculation can depend on the values (e.g., strongly different exponents for a multiply or divide).</p>
  
  <p>Can IEEE-strict floating-point performance depend on value?</p>