Software—Practice & Experience
Computer architecture and organization; (2nd ed.)
Computer architecture and organization; (2nd ed.)
Empirical analysis of a LISP system
Empirical analysis of a LISP system
Mirage: a coherent distributed shared memory design
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Distributed Shared Memory: A Survey of Issues and Algorithms
Computer - Distributed computing systems: separate resources acting as one
CRL: high-performance all-software distributed shared memory
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Structure of a LISP system using two-level storage
Communications of the ACM
A LISP garbage-collector for virtual-memory computer systems
Communications of the ACM
Further experimental data on the behavior of programs in a paging environment
Communications of the ACM
Dynamic Storage Allocation: A Survey and Critical Review
IWMM '95 Proceedings of the International Workshop on Memory Management
Garbage collection in a large LISP system
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Shared virtual memory on loosely coupled multiprocessors
Shared virtual memory on loosely coupled multiprocessors
Multiprocessor execution of functional programs
Multiprocessor execution of functional programs
Hi-index | 0.00 |
Poor memory performance has been associated with functional languages. The MT System is being developed to study the design choices in the development of an all-software based distributed virtual memory for a pure list-based functional language. Of key importance is to understand the virtual memory behaviour of the different components of a pure functional system. In this paper, we present results obtained from observing the paging behaviour of the MT heap that demonstrate the virtual memory benefits of using the MT allocation algorithm over allocation algorithms that box their data. FIFO performs nearly as well as LRU for list-based memory on a set of benchmarks which include a metacircular evaluator for MT. The empirical results are explained by the paging behaviour of three frequent high-level memory accessing operations.