High-level programming languages like Prolog free the programmer from the burden of explicit memory management. In Prolog, dynamic memory allocation is done implicitly by creating data structures. The deallocation of data structures which are no longer in use, is the responsibility of the run-time system. Many Prolog implementations are based on the Warren Abstract Machine (WAM), a virtual mach...

We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is to consider the memory as an explicit parameter of the applicative program, thus enabling to implement data structures in terms of memory primitives. On the basis of equivalence preserving source level transformation...

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

Our research is concerned with compiler-independent, tag-free garbage collection for the C ++ programming language. This paper presents a mark-and-sweep collector , and explains how it ameliorates shortcomings of a previous copy collector. The new collector, like the old, uses C ++ 's facilities for creating abstract data types to deene a tracked reference type, called roots, at the level of th...

We present some results and raise some issues regarding benchmarks for evaluating garbage collection in persistent distributed stores. We believe that such issues are relevant due to increasing research activity in this domain. Therefore, deening widely accepted benchmarks to evaluate the performance and impact of garbage collection solutions is urgent. Currently, the performance of garbage col...

Concurrent garbage collectors (CGC) have recently obtained extensive concern on multicore platform. Excellent designed CGC can improve the efficiency of runtime systems by exploring the full potential processing resources of multicore computers. Two major performance critical components for designing CGC are studied in this paper, stack scanning and heap compaction. Since the lock-based algorit...

We present a multiprocessor “stop-the-world” garbage collection framework that provides multiple forms of load balancing. Our parallel collectors use this framework to balance the work of root scanning, using static overpartitioning, and also to balance the work of tracing the object graph, using a form of dynamic load balancing called work stealing. We describe two collectors written using thi...

It seems silly and impractical: to write a garbage collector (for a Prolog engine) in Prolog itself. However, there are at least three advantages in doing so: (1) one gets a runnable specification of the garbage collector, (2) it can enhance understanding of the algorithms involved without having to worry about gory pointer details, (3) the garbage collector written in Prolog can be used for de...

This study sought to elicit a discussion about the significance of garbage from the standpoint of a group of municipal garbage collectors and garbage recyclers resident in Fortaleza, State of Ceará. Using qualitative methodology and the individual interview technique, this work presents the results of ongoing research that has been conducted together with the employees involved in the collectio...