#8255: GC Less Operation
-------------------------------------+-------------------------------------
Reporter: sirinath | Owner:
Type: feature request | Status: closed
Priority: lowest | Milestone: _|_
Component: Compiler | Version: 7.7
Resolution: invalid | Keywords:
Operating System: Unknown/Multiple | Architecture: Unknown/Multiple
Type of failure: Runtime | Difficulty: Project (more
performance bug | than a week)
Test Case: | Blocked By:
Blocking: | Related Tickets:
-------------------------------------+-------------------------------------
Comment (by ezyang):
I'd also remark that with a copying collector, the scheme described in
comment 8 probably isn't buying you much. Recall that the cost of tracing
is only applicable to data that's live: so (paradoxically), the more
garbage you have, the faster GC runs. Regions only begin to buy you
performance when you are able to reason about lifetimes which carry beyond
life-and-death in the nursery. Additionally when the lifetime of an object
is really short, you can usually rely on the optimizer to remove the heap
allocation altogether. So the current GC is quite a tough benchmark to
beat!
--
Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/8255#comment:12>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
ghc-tickets mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/ghc-tickets
