Faster Laziness Using Dynamic Pointer Tagging
Alexey
Simon Marlow, Alexey Rodriguez Yakushev and Simon Peyton Jones. At the 2007 ACM SIGPLAN International Conference on Functional Programming
In the light of evidence that Haskell programs compiled by GHC exhibit
large numbers of mispredicted branches on modern processors, we
re-examine the "tagless" aspect of the STG-machine that GHC uses as
its evaluation model.
We propose two tagging strategies: a simple strategy called
semi-tagging that seeks to avoid one common source of unpredictable
indirect jumps, and a more complex strategy called dynamic
pointer-tagging that uses the spare low bits in a pointer to encode
information about the pointed-to object. Both of these strategies
have been implemented and exhaustively measured in the context of a
production compiler, GHC, and the paper contains detailed descriptions
of the implementations. Our measurements demonstrate significant
performance improvements (14% for dynamic pointer-tagging with only a
2% increase in code size), and we further demonstrate that much of the
improvement can be attributed to the elimination of mispredicted
branch instructions.
As part of our investigations we also discovered that one optimisation
in the STG-machine, vectored-returns, is no longer worthwhile and we
explain why.
Paper: (pdf)