Hi and welcome to the second episode of the .NET GC internals! Yesterday is was 1.5h of talking about the (non-concurrent) Mark phase. The one responsible for discovering which object are “reachable” and which may be garbage collected. I’ve covered topics like object graph traversal algorithm, the pinning and marking flag, the mark stack and mark list data structures. And obviously, some deep dive into the gc.cpp at the end.
Enjoy watching the recording on YouTube and if you have any questions, do not hesitate to ask!
And do not forget to join Wednesday, 3rd of February 7PM CET – this time I’ll cover Concurrent Mark phase.