I have always been interested in garbage collection algorithms and language runtimes. And recently got my hands on "The Garbage Collection Handbook"[1].<p>My questions is, how can I go about implementing these algorithms :<p>- are there any student focused language VMs that anyone can recommend ?<p>- or any other recommendations on how to go about them?<p>[1] http://gchandbook.org/
The Art of Computer Programming Vol 1: Fundamental Algorithms has a chapter on GC for linked lists which is interesting and shows implementation, there's also the Golang forums/mailing lists which discuss GC and it's optimization <a href="https://blog.golang.org/go15gc" rel="nofollow">https://blog.golang.org/go15gc</a><p>SICP also has a chapter on GC w/implementation <a href="https://mitpress.mit.edu/sicp/full-text/sicp/book/node117.html" rel="nofollow">https://mitpress.mit.edu/sicp/full-text/sicp/book/node117.ht...</a><p>Universities have some lectures on this too and you can look up the algorithms they mention<p><a href="https://suif.stanford.edu/~courses/cs243/lectures/l14.pdf" rel="nofollow">https://suif.stanford.edu/~courses/cs243/lectures/l14.pdf</a> Intro to GC<p><a href="http://web.stanford.edu/class/cs243/lectures/L17-Advanced-GC.pdf" rel="nofollow">http://web.stanford.edu/class/cs243/lectures/L17-Advanced-GC...</a> Advanced GC
A prerequisite to that book is understanding objects and pointers. With that I mean how they are represented in actual memory. We don't have to deal with those details when using HLLs. E.g the book talks a lot about "slots" but it is useless unless you understand how a slot and how a reference to a slot is implemented.<p>Therefore firm knowledge of C is required. Then when you have that knowledge, you can build an object model. I suggest starting with just two simple types: array and integer objects.<p>Then you can implement simple memory management. The easiest is probably to begin with reference counting. After you have that, continue with mark and sweep, copying collection and more advanced techniques.