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/ |
| _version_ | 1828677984517619712 |
|---|---|
| author | Martin, Johannes J. |
| author_facet | Martin, Johannes J. |
| author_sort | Martin, Johannes J. |
| collection | Computer Science@Virginia Tech: Computer Science Technical Reports (CSTR) |
| 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 |
| genre | The Pointers |
| genre_facet | The Pointers |
| id | ftvirginiatech:oai:vtcstechreports.OAI2:849 |
| institution | Open Polar |
| language | unknown |
| op_collection_id | ftvirginiatech |
| op_relation | http://eprints.cs.vt.edu/archive/00000849/ |
| publishDate | 1980 |
| record_format | openpolar |
| spelling | ftvirginiatech:oai:vtcstechreports.OAI2:849 2025-04-06T15:07:36+00: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 http://eprints.cs.vt.edu/archive/00000849/ Historical Collection(Till Dec 2001) Departmental Technical Report 1980 ftvirginiatech 2025-03-10T04:03:24Z 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) |
| spellingShingle | Historical Collection(Till Dec 2001) Martin, Johannes J. A Variant of the Fisher-Morris Garbage Compaction Algorithm |
| title | 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_short | A Variant of the Fisher-Morris Garbage Compaction Algorithm |
| title_sort | variant of the fisher-morris garbage compaction algorithm |
| topic | Historical Collection(Till Dec 2001) |
| topic_facet | Historical Collection(Till Dec 2001) |
| url | http://eprints.cs.vt.edu/archive/00000849/ |