[GHC] #3586: Slow array code

[GHC]

#3586: Slow array code
-----------------------------------------+----------------------------------
    Reporter:  simonpj                   |        Owner:                  
        Type:  run-time performance bug  |       Status:  new             
    Priority:  normal                    |    Milestone:                  
   Component:  Compiler                  |      Version:  6.10.4          
    Severity:  normal                    |   Resolution:                  
    Keywords:                            |   Difficulty:  Unknown         
    Testcase:                            |           Os:  Unknown/Multiple
Architecture:  Unknown/Multiple          |  
-----------------------------------------+----------------------------------
Comment (by int-e):

 Replying to [comment:8 simonpj]:
 > Adrian Hey points out that #650 (a long-standing performance bug in GC
 of mutable arrays) may be relevant here.

 Yes, that explains that most of the time is spent doing GC in the boxed
 array version without increasing the heap size. It does not explain why
 switching to unboxed arrays makes the program slower. (We have tracked
 down the reason for that, see earlier comments.)

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