 We are working on scheduling of garbage collector as a concurrent thread for time-constrained applications in Common Language Infrastructure (CLI). We have implemented an incremental garbage collector with fine-grained write barrier in MONO, an opensource implementation of CLI. Our collector is based on existing conservative garbage collector of Boehm et al. By conducting benchmarking experim...


 Global plastic pollution in waterways is a serious environmental concern predicted to increase the coming years with many groups currently invested monitoring and removing plastics from aquatic ecosystems. Still, available data on sources pathways of larger floating freshwater environments scarce. To bridge this gap, we present computer vision model prototype identify trash primarily nat...

Generational garbage collection is an established method for creating eecient garbage collectors. Even a simple implementation where all nodes that survive one garbage collection are tenured, i.e., moved to an old generation , works well in strict languages. In lazy languages, however, such an implementation can create severe temporary space leaks. The temporary space leaks appear in programs t...

Gardens is a system which supports parallel computation across networks of workstations. This is achieved by over decomposing a program into more tasks than there are processors. Tasks have separate heaps which comprise partitions (segments) of a global address space. Gardens supports a modern object oriented programming language which requires garbage collection. Furthermore since tasks may be...

Garbage collection prevents security vulnerabilities that can otherwise be caused by incorrect manual memory management at the cost of increased runtime and space overheads. In some domains, the runtime overhead and unpredictable, lengthy pauses for garbage collection could be deemed unacceptable. Decades of research have proposed incremental, concurrent, and generational garbage collection as ...

This paper will present the cache performance analysis of Chronological Garbage Collection algorithm used in the LVM system. The LVM is a new Logic Virtual Machine for Prolog. It adopts one stack policy for all dynamic memory requirements and cooperates with an efficient garbage collection algorithm, the Chronological Garbage Collection, to recuperate space not as deliberate garbage collection ...

In algorithms based on reference counting, a garbage-collection decision has to be made whenever a pointer x→ y is about to be destroyed. At this time, the node y may become dead even if y’s reference count is not zero. This is because y may belong to a piece of cyclic garbage. Some aggressive collection algorithms will put y on the list of potential garbage regardless of y’s reference count. L...

Incremental algorithms are often used to interleave the work of a garbage collector with the execution of an application program, the intention being to avoid long pauses. However, overestimating the worst-case storage needs of the program often causes all the garbage collection work to be performed in the beginning of the garbage collection cycles, slowing down the application program to an un...