Martin, Johannes J.2013-06-192013-06-191980http://hdl.handle.net/10919/20326The garbage compactification algorithm described works in linear time and, for the most part, does not require any work space. It combines marking and compactification into a two-step algorithm. The first step marks all non-garbage cells and, at the same time, rearranges the pointers such that the cells can be moved, the second step performs the actual compatification.application/pdfenIn CopyrightTechnical reportCS80006-Rhttp://eprints.cs.vt.edu/archive/00000849/01/CS80006-R.pdf