Author:
Dybvig R. Kent,Bruggeman Carl,Eby David
Abstract
This paper describes a new language feature that allows dynamically allocated objects to be saved from deallocation by an automatic storage management system so that clean-up or other actions can be performed using the data stored within the objects. The program has full control over the timing of clean-up actions, which eliminates several potential problems and often eliminates the need for critical sections in code that interacts with clean-up actions. Our implementation is “generation-friendly” in the sense that the additional overhead within a generation-based garbage collector is proportional to the work already done there, and the overhead within the mutator is proportional to the number of clean-up actions actually performed.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference11 articles.
1. G. E. Collins. A method for overlapping and erasure of lists. Communications of the A C'M 3(12):655-657 December 1960. 10.1145/367487.367501 G. E. Collins. A method for overlapping and erasure of lists. Communications of the A C'M 3(12):655-657 December 1960. 10.1145/367487.367501
2. Ken Dickey. private communication. Ken Dickey. private communication.
3. R. Kent Dybvig David Eby and Carl Bruggeman. Flexible and efficient storage management using a segmented heap. in preparation. R. Kent Dybvig David Eby and Carl Bruggeman. Flexible and efficient storage management using a segmented heap. in preparation.
4. A new approach to procedures with variable arity
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Rebuilding racket on chez scheme (experience report);Proceedings of the ACM on Programming Languages;2019-07-26
2. Light‐weight resource leak testing based on finalisers;IET Software;2013-12
3. Resco: Automatic Collection of Leaked Resources;IEICE Transactions on Information and Systems;2013
4. Ephemerons;ACM SIGPLAN Notices;1997-10-09