Loading...
Please wait, while we are loading the content...
Similar Documents
Guardians in a Generation-Based Garbage Collector (1993)
| Content Provider | CiteSeerX |
|---|---|
| Author | David, E. Dybvig, Kent Bruggeman, Carl |
| Description | In SIGPLAN Symposium on Programming Language Design and Implementation (PLDI'93 |
| 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. 1 Introduction Many programming systems, such as Scheme, Common Lisp, ML, and Prolog, support dynamic allocation and automatic deallocation of objects. Within these systems, some form of storage manager takes responsibility for handling both requests to al... |
| File Format | |
| Publisher Date | 1993-01-01 |
| Access Restriction | Open |
| Subject Keyword | New Language Feature Generation-based Garbage Collector Automatic Deallocation Storage Manager Critical Section Full Control Clean-up Action Common Lisp Automatic Storage Management System Several Potential Problem Introduction Many Additional Overhead Support Dynamic Allocation |
| Content Type | Text |
| Resource Type | Conference Proceedings Article |
