ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
A note on the efficiency of a LISP computation in a paged machine
Full text PdfPdf (241 KB)
Source
Communications of the ACM archive
Volume 11 ,  Issue 8  (August 1968) table of contents
Page: 558  
Year of Publication: 1968
ISSN:0001-0782
Authors
Daniel G. Bobrow  Bolt Beranek and Newman Inc, Cambridge, MA
Daniel L. Murphy  Bolt Beranek and Newman Inc, Cambridge, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/363567.363581
What is a DOI?

ABSTRACT

The problem of the use of two levels of storage for programs is explored in the context of a LISP system which uses core memory as a buffer for a large virtual memory stored on a drum. Details of timing are given for one particular problem.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
Daniel G. Bobrow , Daniel L. Murphy, Structure of a LISP system using two-level storage, Communications of the ACM, v.10 n.3, p.155-159, March 1967  [doi>10.1145/363162.363185]
2
Jacques Cohen, A use of fast and slow memories in list-processing languages, Communications of the ACM, v.10 n.2, p.82-86, Feb. 1967  [doi>10.1145/363067.363092]

CITED BY  5
Arnold Rochfeld, New LISP techniques for a paging environment, Communications of the ACM, v.14 n.12, p.791-795, Dec. 1971
Jacques Cohen, Garbage Collection of Linked Data Structures, ACM Computing Surveys (CSUR), v.13 n.3, p.341-367, Sept. 1981
David F. Bacon , Perry Cheng , David Grove, Garbage collection for embedded systems, Proceedings of the 4th ACM international conference on Embedded software, September 27-29, 2004, Pisa, Italy
Matthew Hertz , Yi Feng , Emery D. Berger, Garbage collection without paging, ACM SIGPLAN Notices, v.40 n.6, June 2005
Daniel L. Murphy, Storage organization and management in TENEX, Proceedings of the December 5-7, 1972, fall joint computer conference, part I, December 05-07, 1972, Anaheim, California

INDEX TERMS

Keywords:
LISP, efficiency of paged computations, list processor implementation, paging, secondary storage utilization, storage management

Collaborative Colleagues:
Daniel G. Bobrow: colleagues
Daniel L. Murphy: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player