[GHC] #13165: Speed up the RTS hash table

[GHC]

#13165: Speed up the RTS hash table
-------------------------------------+-------------------------------------
        Reporter:  dobenour          |                Owner:  (none)
            Type:  bug               |               Status:  new
        Priority:  normal            |            Milestone:
       Component:  Runtime System    |              Version:  8.1
      Resolution:                    |             Keywords:  newcomer
Operating System:  Unknown/Multiple  |         Architecture:
                                     |  Unknown/Multiple
 Type of failure:  None/Unknown      |            Test Case:
      Blocked By:                    |             Blocking:
 Related Tickets:                    |  Differential Rev(s):
       Wiki Page:                    |
-------------------------------------+-------------------------------------

Comment (by NoidedSuper):

 I'm going to take a crack at implementing a linear probing table today,
 since that seems to be the easiest thing to do. I think specializing the
 hash table for different key types will probably yield more performance
 benefits in the long run, but getting some cache-friendliness with linear
 probing is better than nothing!

-- 
Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/13165#comment:12>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler