Ömer Sinan Ağacan writes:
> Here's another improvement that fixes a very old issue in GHC's compacting GC
> [1].
>
> To summarize the problem: when untreading an object we update references to
> the
> object that we've seen so far to the object's new location. But to get the
> object's new locat
s im Auftrag von Ömer Sinan Ağacan
Gesendet: Thursday, September 2, 2021 5:47:08 PM
An: ghc-devs
Betreff: Re: Potential improvement in compacting GC
Here's another improvement that fixes a very old issue in GHC's compacting GC
[1].
To summarize the problem: when untreading an object we up
Here's another improvement that fixes a very old issue in GHC's compacting GC
[1].
To summarize the problem: when untreading an object we update references to the
object that we've seen so far to the object's new location. But to get the
object's new location we need to know the object's size, bec
ere's a talk about MMTk: https://www.youtube.com/watch?v=3L6XEVaYAmU
>
> Simon
>
>
> | -Original Message-----
> | From: ghc-devs On Behalf Of Ömer Sinan
> | Agacan
> | Sent: 14 July 2021 07:27
> | To: ghc-devs
> | Subject: Re: Potential improvement
;d be cool.
Here's a talk about MMTk: https://www.youtube.com/watch?v=3L6XEVaYAmU
Simon
| -Original Message-
| From: ghc-devs On Behalf Of Ömer Sinan
| Agacan
| Sent: 14 July 2021 07:27
| To: ghc-devs
| Subject: Re: Potential improvement in compacting GC
|
| Two other id
Two other ideas that should improve GHC's compacting GC much more
significantly. I've implemented both of these in another project and the
results were great. In a GC benchmark (mutator does almost no work other than
allocating data using a bump allocator), first one reduced Wasm instructions
execu
Hello,
I recently implemented the algorithm used by GHC's compacting GC in another
project. The algorithm (after marking) makes two passes over the heap
/generation. In GHC, these passes are implemented in [1] and in the next
function.
In my implementation I tried 3 ways of implementing these pas
