I might do that. In the meantime, Henry Baker's archive[1] contains lots of techniques on garbage collection and heap compaction. I often recommend it.

Reference counting can fit on a page[2]. Even though Perl uses it where it's a bad fit, Q/KDB use it and it's a great fit: Because arrays are very big, being able to optimise on count=1 and reuse the buffer is a valuable optimisation!

Something that I think would be useful would be an examination of the performance characteristics of different techniques (especially considering new superscalar chips and hardware transactional memory), but this would take some time.

[1]: https://news.ycombinator.com/item?id=10871801

[2]: http://www.brpreiss.com/books/opus5/html/page421.html

The editor of the post, Ravenbrook, maintains a very well written Memory Management Reference: http://www.memorymanagement.org/