Affiliation:
1. Texas Instruments, Inc., Austin, TX
Abstract
Modern Lisp systems make heavy use of a garbage-collecting style of memory management. Generally, the locality of reference in garbage-collected systems has been very poor. In virtual memory systems, this poor locality of reference generally causes a large amount of wasted time waiting on page faults or uses excessively large amounts of main memory. An adaptive memory management algorithm, described in this article, allows substantial improvement in locality of reference. Performance measurements indicate that page-wait time typically is reduced by a factor of four with constant memory size and disk technology. Alternately, the size of memory typically can be reduced by a factor of two with constant performance.
Publisher
Association for Computing Machinery (ACM)
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Mutator-Driven Object Placement using Load Barriers;Proceedings of the 21st ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes;2024-09-13
2. Getting a Handle on Unmanaged Memory;Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3;2024-04-27
3. Cache efficient functional algorithms;Communications of the ACM;2015-06-25
4. Cache and I/O efficent functional algorithms;ACM SIGPLAN Notices;2013-01-23
5. Data layouts for object-oriented programs;ACM SIGMETRICS Performance Evaluation Review;2007-06-12