Concurrent Compaction in JVM Garbage Collection

This paper provides a brief overview of both garbage collection (GC) of memory and parallel processing. We then cover how parallel processing applies to GC. Specifically, these concepts are focused within the context of the Java Virtual Machine (JVM). With that foundation, we look at various algorithms that perform compaction of fragmented memory during the GC process. These algorithms are designed to run concurrent to the application running. Such concurrently compacting GC behavior stems from a desire to reduce \stop-the-world pauses of an application

Visualising the Logs of Shenandoah Garbage Collection Algorithm

Käesoleva lõputöö eesmärgiks on Red Hati uue mälukoristusalgoritmi Shenandoah logide parseri implementeerimine avatud lähtekoodiga projekti GCViewer raames. Lisaeesmärgiks on anda ülevaade Java mälukoristuse abstraktsioonist.Lõputöö koosneb kahest osast - esimeses osas uuritakse süvendatult prügikoristuse abstraktsiooni Javas ning selle erinevaid implementatsioone, logisüsteemi plaanitavaid muudatusi Java 9 ning teises osas kirjeldatakse parseri implementeerimist ja selle valideerimist.Töö käigus loodi eelmainitud Shenandoah parser, valideeriti see, ning tehti pull request selle GCVieweri projekti lisamiseks.The aim of the current thesis is to implement a Garbage Collection log parser for Red Hat’s Garbage Collection algorithm Shenandoah by extending an open-source project GCViewer. Additional aim is to take a further look into the Garbage Collection in Java. The thesis is split into two main parts. The first part describes the background of Garbage Collection in Java and upcoming changes to the logging system in Java 9. The second part covers the implementation and the validation of the parser.The intended Shenandoah parser was implemented, validated, and a pull request to add it to GCViewer project was created

Garbage Collection of Linked Data Structures: An Example in a Network Oriented Database Management System

A unified view of the numerous existing algorithms for performing garbage collection of linked data structure has been presented. An implementation of a garbage collection tool in a network oriented database management system has been described

A Cyclic Distributed Garbage Collector for Network Objects

This paper presents an algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference listing scheme, which is augmented by partial tracing in order to collect distributed garbage cycles. Processes may be dynamically organised into groups, according to appropriate heuristics, to reclaim distributed garbage cycles. The algorithm places no overhead on local collectors and suspends local mutators only briefly. Partial tracing of the distributed graph involves only objects thought to be part of a garbage cycle: no collaboration with other processes is required. The algorithm offers considerable flexibility, allowing expediency and fault-tolerance to be traded against completeness