[GHC] #10652: Better cache performance in Array#

[GHC]

#10652: Better cache performance in Array#
-------------------------------------+-------------------------------------
        Reporter:  MikeIzbicki       |                   Owner:
            Type:  feature request   |                  Status:  new
        Priority:  normal            |               Milestone:
       Component:  Compiler          |                 Version:  7.10.1
      Resolution:                    |                Keywords:
Operating System:  Unknown/Multiple  |            Architecture:
 Type of failure:  None/Unknown      |  Unknown/Multiple
      Blocked By:                    |               Test Case:
 Related Tickets:                    |                Blocking:
                                     |  Differential Revisions:
-------------------------------------+-------------------------------------

Comment (by carter):

 roughly: as long as the GC does a *breadth first* copy of the values
 reachable through a boxed array, in  left to right order, you should have
 the behavior you want. i *believe* ghc roughly does this in a depth first
 order, but i could be wrong

 likewise,
 https://ghc.haskell.org/trac/ghc/wiki/Commentary/Rts/Storage/GC/Copying
 provides some more information about the rough flavor of the copying
 algorithms.

 one challenge might be that the underlying storage layer of the GC is
 block oriented, and i believe the GC can promote a block of memory between
 generations instead of just copying

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