Garbage Collection of Linked Data Structures
نویسندگان
چکیده
منابع مشابه
Extending Garbage Collection to Complex Data Structures
Objects that are pointer reachable through a complex data structure may be inaccessible to the external program, depending on the semantics of the structure. Failure to recognize the unusual behavior of complex data structures causes memory leaks in any collector that relies on pointer reachability to locate garbage. We extend the definition of reachability to distinguish between objects that a...
متن کاملEecient Compile-time Garbage Collection for Arbitrary Data Structures
This paper describes a compile-time garbage collection (ct-gc) method in the setting of a rst-order functional language with data structures. The aim is to obtain information on positions in a program where certain heap cells will become obsolete during execution. Therefore we develop an abstract interpretation for the detection of inheritance information which allows us to detect whether the h...
متن کاملEfficient Compile-Time Garbage Collection for Arbitrary Data Structures
This paper describes a compile-time garbage collection (ctgc) method in the setting of a rst-order functional language with data structures. The aim is to obtain information on positions in a program where certain heap cells will become obsolete during execution. Therefore we develop an abstract interpretation for the detection of inheritance information which allows us to detect whether the he...
متن کاملReconngurable Garbage Collection of Data Structures in a Speculative Real-time System
Garbage collection can be carried out on-demand in a non-real-time system. However, a real-time system can aaord this overhead only during intervals ofìdle' time. We motivate the usefulness of reconnguring the available memory for data structures, and the intervals of garbage collection of these data structures, in a parallel real-time system performing speculative execution. After brieey menti...
متن کاملUniprocessor Garbage Collection Techniques
We survey basic garbage collection algorithms and variations such as incremental and gen erational collection The basic algorithms include reference counting mark sweep mark compact copy ing and treadmill collection Incremental techniques can keep garbage collection pause times short by interleaving small amounts of collection work with program execution Generational schemes improve e ciency an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Computing Surveys
سال: 1981
ISSN: 0360-0300,1557-7341
DOI: 10.1145/356850.356854