Optimal memory management in a system with garbage collection

1974 ◽  
Vol 14 (4) ◽  
pp. 375-381
Author(s):  
Stefan Arnborg
Keyword(s):  
Memory Management ◽  
Garbage Collection

Integrating region memory management and tag-free generational garbage collection

2021 ◽  
Vol 31 ◽  
Author(s):  
MARTIN ELSMAN ◽  
NIELS HALLENBERG
Keyword(s):  
Memory Management ◽  
Garbage Collection ◽  
State Of The Art ◽  
Type System ◽  
Inference Algorithm ◽  
Machine Code ◽  
Standard Ml ◽  
Management Scheme ◽  
Time Region ◽  
Formal Properties

Abstract We present a region-based memory management scheme with support for generational garbage collection. The scheme features a compile-time region inference algorithm, which associates values with logical regions, and builds on a region type system that deploys region types at runtime to avoid the overhead of write barriers and to support partly tag-free garbage collection. The scheme is implemented in the MLKit Standard ML compiler, which generates native x64 machine code. Besides demonstrating a number of important formal properties of the scheme, we measure the scheme’s characteristics, for a number of benchmarks, and compare the performance of the generated executables with the performance of executables generated with the MLton state-of-the-art Standard ML compiler and configurations of the MLKit with and without region inference and generational garbage collection enabled. Although region inference often serves the purpose of generations, combining region inference with generational garbage collection is shown often to be superior to combining region inference with non-generational collection despite the overhead introduced by a larger amount of memory waste, due to region fragmentation.

EQUALS – a fast parallel implementation of a lazy language

1997 ◽  
Vol 7 (2) ◽  
pp. 183-217 ◽  
Author(s):  
OWEN KASER ◽  
C. R. RAMAKRISHNAN ◽  
I. V. RAMAKRISHNAN ◽  
R. C. SEKAR
Keyword(s):  
Shared Memory ◽  
Memory Management ◽  
Garbage Collection ◽  
Parallel Implementation ◽  
Parallel Machine ◽  
Functional Language ◽  
Parallel Performance ◽  
Strictness Analysis ◽  
Reference Counting ◽  
Sequential Implementation

This paper describes EQUALS, a fast parallel implementation of a lazy functional language on a commercially available shared-memory parallel machine, the Sequent Symmetry. In contrast to previous implementations, we propagate normal form demand at compile time as well as run time, and detect parallelism automatically using strictness analysis. The EQUALS implementation indicates the effectiveness of NF-demand propagation in identifying significant parallelism and in achieving good sequential as well as parallel performance. Another important difference between EQUALS and previous implementations is the use of reference counting for memory management, instead of mark-and-sweep or copying garbage collection. Implementation results show that reference counting leads to very good scalability and low memory requirements, and offers sequential performance comparable to generational garbage collectors. We compare the performance of EQUALS with that of other parallel implementations (the 〈v, G〉-machine and GAML) as well as with the performance of SML/NJ, a sequential implementation of a strict language.

scholarly journals A performance comparison of garbage collector algorithms in Java Virtual Machine

2019 ◽  
Vol 13 ◽  
pp. 359-365
Author(s):  
Igor Kopeć ◽  
Jakub Smołka
Keyword(s):  
Programming Languages ◽  
Memory Management ◽  
Garbage Collection ◽  
Performance Comparison ◽  
Java Virtual Machine ◽  
Garbage Collector ◽  
System Responsiveness ◽  
Automatic Memory ◽  
A Performance

In programming languages with automatic memory management garbage collection plays an important role of cleaning unused memory. Garbage collection algorithms have been developed for many years and aim to maximize the application’s performance. This paper presents and compares a performance of five garbage collection algorithms present in current version of Java 12 in three applications with different object lifetime span. The analysis covered the system responsiveness, garbage collector workload and application throughput at high application load.

Sign in / Sign up

Export Citation Format

Share Document