A Variant of the Fisher-Morris Garbage Compaction Algorithm
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 c...
| Main Author: | |
|---|---|
| Format: | Report |
| Language: | unknown |
| Published: |
1980
|
| Subjects: | |
| Online Access: | http://eprints.cs.vt.edu/archive/00000849/ |
| id |
ftvirginiatech:oai:vtcstechreports.OAI2:849 |
|---|---|
| record_format |
openpolar |
| spelling |
ftvirginiatech:oai:vtcstechreports.OAI2:849 2023-05-15T18:32:38+02:00 A Variant of the Fisher-Morris Garbage Compaction Algorithm Martin, Johannes J. 1980-01-01 http://eprints.cs.vt.edu/archive/00000849/01/CS80006-R.pdf http://eprints.cs.vt.edu/archive/00000849/ unknown Historical Collection(Till Dec 2001) Departmental Technical Report 1980 ftvirginiatech 2016-11-16T15:44:47Z 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. Report The Pointers Computer Science@Virginia Tech: Computer Science Technical Reports (CSTR) |
| institution |
Open Polar |
| collection |
Computer Science@Virginia Tech: Computer Science Technical Reports (CSTR) |
| op_collection_id |
ftvirginiatech |
| language |
unknown |
| topic |
Historical Collection(Till Dec 2001) |
| spellingShingle |
Historical Collection(Till Dec 2001) Martin, Johannes J. A Variant of the Fisher-Morris Garbage Compaction Algorithm |
| topic_facet |
Historical Collection(Till Dec 2001) |
| description |
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. |
| format |
Report |
| author |
Martin, Johannes J. |
| author_facet |
Martin, Johannes J. |
| author_sort |
Martin, Johannes J. |
| title |
A Variant of the Fisher-Morris Garbage Compaction Algorithm |
| title_short |
A Variant of the Fisher-Morris Garbage Compaction Algorithm |
| title_full |
A Variant of the Fisher-Morris Garbage Compaction Algorithm |
| title_fullStr |
A Variant of the Fisher-Morris Garbage Compaction Algorithm |
| title_full_unstemmed |
A Variant of the Fisher-Morris Garbage Compaction Algorithm |
| title_sort |
variant of the fisher-morris garbage compaction algorithm |
| publishDate |
1980 |
| url |
http://eprints.cs.vt.edu/archive/00000849/ |
| genre |
The Pointers |
| genre_facet |
The Pointers |
| _version_ |
1766216843325865984 |