Loading...
Please wait, while we are loading the content...
Similar Documents
Exploring the barrier to entry — incremental generational garbage collection for Haskell (2004)
| Content Provider | CiteSeerX |
|---|---|
| Author | Cheadle, A. M. Field, A. J. |
| Description | We document the design and implementation of a “production” incremental garbage collector for GHC 6.02. It builds on our earlier work (Non-stop Haskell) that exploited GHC’s dynamic dispatch mechanism to hijack object code pointers so that objects in to-space automatically scavenge themselves when the mutator attempts to “enter ” them. This paper details various optimisations based on code specialisation that remove the dynamic space, and associated time, overheads that accompanied our earlier scheme. We detail important implementation issues and provide a detailed evaluation of a range of design alternatives in comparison with Non-stop Haskell and GHC’s current generational collector. We also show how the same code specialisation techniques can be used to eliminate the write barrier in a generational collector. Categories and Subject Descriptors: D.3.4 [Programming Languages]: Processors—Memory management (garbage collection) |
| File Format | |
| Language | English |
| Publisher | ACM Press |
| Publisher Date | 2004-01-01 |
| Publisher Institution | In Int. Symp. on Memory Management |
| Access Restriction | Open |
| Subject Keyword | Associated Time Dynamic Space Non-stop Haskell Processor Memory Management Production Incremental Garbage Collector Detailed Evaluation Write Barrier Ghc Dynamic Dispatch Mechanism Paper Detail Various Optimisation Code Specialisation Generational Collector Incremental Generational Garbage Collection Subject Descriptor Object Code Pointer Important Implementation Issue Current Generational Collector Programming Language Code Specialisation Technique Design Alternative |
| Content Type | Text |
| Resource Type | Article |
