A Variant of the Fisher-Morris Garbage Compaction Algorithm

dc.contributor.author	Martin, Johannes J.	en
dc.contributor.department	Computer Science	en
dc.date.accessioned	2013-06-19T14:37:16Z	en
dc.date.available	2013-06-19T14:37:16Z	en
dc.date.issued	1980	en
dc.description.abstract	The 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.	en
dc.format.mimetype	application/pdf	en
dc.identifier	http://eprints.cs.vt.edu/archive/00000849/	en
dc.identifier.sourceurl	http://eprints.cs.vt.edu/archive/00000849/01/CS80006-R.pdf	en
dc.identifier.trnumber	CS80006-R	en
dc.identifier.uri	http://hdl.handle.net/10919/20326	en
dc.language.iso	en	en
dc.publisher	Department of Computer Science, Virginia Polytechnic Institute & State University	en
dc.relation.ispartof	Historical Collection(Till Dec 2001)	en
dc.rights	In Copyright	en
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/	en
dc.title	A Variant of the Fisher-Morris Garbage Compaction Algorithm	en
dc.type	Technical report	en
dc.type.dcmitype	Text	en

Files

Now showing 1 - 1 of 1