New LISP Techniques for a Paging Environment.
Saved in:
| Title: | New LISP Techniques for a Paging Environment. |
|---|---|
| Authors: | Rochfeld, Arnold1, Gries, D. |
| Source: | Communications of the ACM. Dec1971, Vol. 14 Issue 12, p791-795. 5p. 2 Diagrams. |
| Subjects: | LISP (Computer program language), List processing (Electronic computers), Computer memory management, Programming languages, Garbage collection (Computer science), Algorithms |
| Abstract: | The system described herein employs the block concept, and that of global and local variables, in addition to the methods applied in most LISP systems. Also, a new means of list representation is used: "local sequential'' for lists created during compilation, and "block level sequential" for those created dynamically. A new garbage collection algorithm has been introduced to make lists as compact as possible; partial garbage collection is performed after each block exit instead of total garbage collection when storage is exhausted. The algorithm does not use the customary flagging procedure. This combination of features has eliminated the need for a free list, and effectively minimizes the number of pages used at any moment. [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: 5221605 AccessLevel: 6 PubType: Periodical PubTypeId: serialPeriodical PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: New LISP Techniques for a Paging Environment. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Rochfeld%2C+Arnold%22">Rochfeld, Arnold</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Gries%2C+D%2E%22">Gries, D.</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Dec1971, Vol. 14 Issue 12, p791-795. 5p. 2 Diagrams. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22LISP+%28Computer+program+language%29%22">LISP (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22List+processing+%28Electronic+computers%29%22">List processing (Electronic computers)</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="%22Garbage+collection+%28Computer+science%29%22">Garbage collection (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: The system described herein employs the block concept, and that of global and local variables, in addition to the methods applied in most LISP systems. Also, a new means of list representation is used: "local sequential'' for lists created during compilation, and "block level sequential" for those created dynamically. A new garbage collection algorithm has been introduced to make lists as compact as possible; partial garbage collection is performed after each block exit instead of total garbage collection when storage is exhausted. The algorithm does not use the customary flagging procedure. This combination of features has eliminated the need for a free list, and effectively minimizes the number of pages used at any moment. [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=5221605 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/362919.362937 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 5 StartPage: 791 Subjects: – SubjectFull: LISP (Computer program language) Type: general – SubjectFull: List processing (Electronic computers) Type: general – SubjectFull: Computer memory management Type: general – SubjectFull: Programming languages Type: general – SubjectFull: Garbage collection (Computer science) Type: general – SubjectFull: Algorithms Type: general Titles: – TitleFull: New LISP Techniques for a Paging Environment. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Rochfeld, Arnold – PersonEntity: Name: NameFull: Gries, D. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 12 Text: Dec1971 Type: published Y: 1971 Identifiers: – Type: issn-print Value: 00010782 Numbering: – Type: volume Value: 14 – Type: issue Value: 12 Titles: – TitleFull: Communications of the ACM Type: main |
| ResultId | 1 |
