An Efficient, Incremental, Automatic Garbage Collector.
Saved in:
| Title: | An Efficient, Incremental, Automatic Garbage Collector. |
|---|---|
| Authors: | Deutsch, L. Peter1, Bobrow, Daniel G.1, Manacher, G., Graham, S. L. |
| Source: | Communications of the ACM. Sep76, Vol. 19 Issue 9, p522-526. 5p. |
| Subjects: | Garbage collection (Computer science), Computer memory management, Programming languages, Computer systems, Algorithms, Computer programmers |
| Abstract: | This paper describes a new way of solving the storage reclamation problem for a system such as Lisp that allocates storage automatically from a heap, and does not require the programmer to give any indication that particular items are no longer useful or accessible. A reference count scheme for reclaiming non-self-referential structures, and a linearizing, compacting, copying scheme to reorganize all storage at the users discretion are proposed. The algorithms are designed to work well in systems which use multiple levels of storage, and large virtual address space. They depend on the fact that most cells are referenced exactly once, and that reference counts need only be accurate when storage is about to be reclaimed. A transaction file stores changes to reference counts, and a multiple reference table stores the count for items which are referenced more than once. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 5221691 AccessLevel: 6 PubType: Periodical PubTypeId: serialPeriodical PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: An Efficient, Incremental, Automatic Garbage Collector. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Deutsch%2C+L%2E+Peter%22">Deutsch, L. Peter</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Bobrow%2C+Daniel+G%2E%22">Bobrow, Daniel G.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Manacher%2C+G%2E%22">Manacher, G.</searchLink><br /><searchLink fieldCode="AR" term="%22Graham%2C+S%2E+L%2E%22">Graham, S. L.</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Sep76, Vol. 19 Issue 9, p522-526. 5p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Garbage+collection+%28Computer+science%29%22">Garbage collection (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+memory+management%22">Computer memory management</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programmers%22">Computer programmers</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This paper describes a new way of solving the storage reclamation problem for a system such as Lisp that allocates storage automatically from a heap, and does not require the programmer to give any indication that particular items are no longer useful or accessible. A reference count scheme for reclaiming non-self-referential structures, and a linearizing, compacting, copying scheme to reorganize all storage at the users discretion are proposed. The algorithms are designed to work well in systems which use multiple levels of storage, and large virtual address space. They depend on the fact that most cells are referenced exactly once, and that reference counts need only be accurate when storage is about to be reclaimed. A transaction file stores changes to reference counts, and a multiple reference table stores the count for items which are referenced more than once. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5221691 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/360336.360345 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 5 StartPage: 522 Subjects: – SubjectFull: Garbage collection (Computer science) Type: general – SubjectFull: Computer memory management Type: general – SubjectFull: Programming languages Type: general – SubjectFull: Computer systems Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Computer programmers Type: general Titles: – TitleFull: An Efficient, Incremental, Automatic Garbage Collector. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Deutsch, L. Peter – PersonEntity: Name: NameFull: Bobrow, Daniel G. – PersonEntity: Name: NameFull: Manacher, G. – PersonEntity: Name: NameFull: Graham, S. L. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep76 Type: published Y: 1976 Identifiers: – Type: issn-print Value: 00010782 Numbering: – Type: volume Value: 19 – Type: issue Value: 9 Titles: – TitleFull: Communications of the ACM Type: main |
| ResultId | 1 |
