Dynamic memory management is a known performance bottleneck of Java applications. The problem arises out of the Java memory model in which all objects (non-primitive type instances) are allocated on the heap and reclaimed by garbage collector when they are no longer needed. This paper presents a simple and fast algorithm for inference of object lifetimes. Given the analysis results, a Java comp...

It is an important problem to analyze the collection costs and determine tenuring collection times to meet the pause time goal for a generational garbage collector. From such viewpoints, this paper analyzes the costs suffered for collections according to the working schemes firstly, and then, proposes one garbage collection model. Garbage collections occur at a nonhomogeneous Poisson process, a...

We expand an acyclic distributed garbage collector (the cleanup protocol of Stub-Scion Pair Chains) with a detector of distributed cycles of garbage. The whole result is as a complete and asynchronous distributed garbage collector. The detection algorithm for free distributed cycles is inspired by Hughes 5]. A local collector marks outgoing references with dates, which are propagated asynchrono...

We propose a prooling tool for experimental evaluation of garbage collection algorithms. Behaviour of the prooler is determined by some probability distributions on object size and life time etc. that are derived from the properties of certain languages or applications. A standard memory management interface allows precise, objective evaluation of several garbage collection algorithms under lab...

Global waste production has doubled over the past ten years. By 2025, the world will produce garbage at a rate of 2.5 billion tonnes per year [5]. Poor waste management in many developing countries is a threat to human health and the environment. Many developing countries struggle towards a sustainable model for waste collection and disposal and despite large expenditures, very few countries ha...

Java is a strong player in the application server market and thus the performance of its virtual machine is an important aspect of a server’s performance. One of the components that affect the performance of a JVM is the memory manager, which also includes the garbage collector. Modern virtual machines offer a multitude of options for tuning the memory manager, which can have a significant impa...

Reference counting schemes are suitable for garbage collection on distributed systems because they do not require global information to nd garbage. However, reference counting schemes have a serious drawback: they cannot reclaim garbage which form cyclic structures. In this paper, we propose an extension of the traditional reference counting scheme, group reference counting, which alleviates th...

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

Fig.1(a): Files A and B initially exist in file system and SSD Fig.1(b): Two different (file system and SSD) viewpoints after file system overwrites file A with A’ and deletes file B Fig.1(c): Pages (B1, B2, and B3) in SSD are not removed even after garbage collection Fig.1(d): Changes to SSD as TRIM is first issued in Fig.1(b) and then, garbage collection performed in SSD ⌘ FTL takes note that...

Garbage collection schemes are investigated to provide a solution well-suited for the distributed object-based system, Emerald. A distributed garbage collection scheme is implemented. It collects all garbage (comprehensive), works while the system is running user applications (concurrent), and copes with partial failures due to the distributed nature of the system (robustness). The collection s...