Minimizing paging in Lisp applications

Authors:
David L. Andre
Affiliations:
Symbolics, Inc.
Venue:
ACM SIGPLAN Lisp Pointers
Year:
1987

Citing 4
Cited 0

Performance and evaluation of LISP systems

Performance and evaluation of LISP systems
A nonrecursive list compacting algorithm

Communications of the ACM
The working set model for program behavior

Communications of the ACM
Garbage collection in a large LISP system

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Paging is an important aspect of performance in any program and can be the overriding consideration in a large system. When developing large applications, the programmer should be as aware of paging overhead as he is of runtime overhead. The programmer should seek to avoid large working sets that cause page faults, just as he avoids order n2 and exponential algorithms.