Abstract
Compact lists are stored sequentially in memory, rather than chained with pointers. Since this is not always convenient, the Swym system permits a list to be chained, compact, or any combination of the two. A description is given of that list representation and the operators implemented (most are similar to those of LISP 1.5). The system garbage collector attempts to make all lists compact; it relocates and rearranges all of list storage using temporary storage. This unique list-compacting garbage collection algorithm is presented in detail. Several classes of the macros used to implement the system are described. Finally, consideration is given to those design factors essential to the success of a plex processing system implementation.
Publisher
Association for Computing Machinery (ACM)
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Study of Energy-Efficient Optimization Techniques for High-Level Homogeneous Resource Management;Wireless Communications and Mobile Computing;2022-07-27
2. FFCCD;Proceedings of the 49th Annual International Symposium on Computer Architecture;2022-06-11
3. Mesh: compacting memory management for C/C++ applications;Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation;2019-06-08
4. References;Memory Systems;2008
5. Fast Functional Lists;Implementation of Functional Languages;2003