We examine basic garbage collection algorithms used in three commercially popular object oriented languages: Java, Smalltalk, and C++. We briefly discuss garbage collection in general, and the methods of garbage collection used in specific implementations of these languages.

This paper proposes methods to pre-process questions in the postings before a QA system can find answers in a discussion group in the Internet. Pre-processing includes garbage text removal and question segmentation. Garbage keywords are collected and different length thresholds are assigned to them for garbage text identification. Interrogative forms and question types are used to segment quest...

Increasingly many modern programming languages are turning to automatic reclamation, or garbage collection, to free up memory objects that are no longer needed. While there are many techniques known for detecting and collecting garbage, what remains a less well-known topic is how differing techniques perform in different application domains; a garbage collector that works well for a word proces...

Most existing reference-based distributed object systems include some kind of acyclic garbage collection, but fail to provide acceptable collection of cyclic garbage. Those that do provide such GC currently suuer from one or more problems: synchronous operation, the need for expensive global consensus or termination algorithms, susceptibility to communication problems, or an algorithm that does...

With the continued growth of distributed systems as a means to provide shared data, designers are turning their attention to garbage collection, prompted by the complexity of memory management and the desire for transparent object management. Garbage collection in very large address spaces is a di cult and unsolved problem, due to problems of e ciency, fault-tolerance, scalability and completen...

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...

This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms of when and how to collect. We argue that garbage collection should be done when the amount of live bytes is low (in order to minimize the collection cost) and when the amount of dead objects is high (in order to maximize the available heap size after collection). In addition, we observe that Appe...