#7670: StablePtrs should be organized by generation for efficient minor collections -------------------------------------+------------------------------------- Reporter: ezyang | Owner: (none) Type: bug | Status: new Priority: normal | Milestone: Component: Runtime System | Version: 7.7 Resolution: | Keywords: 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 dfeuer): You must have missed my edit where I describe such a "remembered set". When there are only two generations, there's only one such, and it can even be a static array (whose size is limited to a fixed fraction of the nursery size). When there are more generations, there are more options and they get harder to think about. Perhaps the way to start is with one hash table for underlying objects in the nursery and one for those in all other generations. I suspect that will give us a lot of the benefits with very few complications. My challenge is that I know very little about the details of garbage collection, so I don't really know how to write this stuff properly. -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/7670#comment:17 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler