A Variant of the Fisher-Morris Garbage Compaction Algorithm
1980) A Variant of the Fisher-Morris Garbage Compaction Algorithm. Technical Report CS80006-R, Computer Science, Virginia Tech. (
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.
|Item Type:||Departmental Technical Report|
|Keywords:||Garbage collection, compaction, compactification, storage reclamation, storage allocation, relocation, list processing, pointers, references, data structures|
|Subjects:||Computer Science > Historical Collection(Till Dec 2001)|
|Deposited By:||Administrator, Eprints|
|Deposited On:||06 May 2006|