A Variant of the Fisher-Morris Garbage Compaction Algorithm

Simple item page
dc.contributor.authorMartin, Johannes J.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:16Zen
dc.date.available2013-06-19T14:37:16Zen
dc.date.issued1980en
dc.description.abstractThe 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.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000849/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000849/01/CS80006-R.pdfen
dc.identifier.trnumberCS80006-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20326en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleA Variant of the Fisher-Morris Garbage Compaction Algorithmen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS80006-R.pdf
Size:
870.5 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports