A note on the efficiency of a LISP computation in a paged machine

  • Authors:
  • Daniel G. Bobrow;Daniel L. Murphy

  • Affiliations:
  • Bolt Beranek and Newman Inc, Cambridge, MA;Bolt Beranek and Newman Inc, Cambridge, MA

  • Venue:
  • Communications of the ACM
  • Year:
  • 1968

Quantified Score

Hi-index 48.23

Visualization

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.