Java Memory Allocation with Lazy Worst Fit for Small Objects

Authors:
Hyung-Kyu Choi;Yoo C. Chung;Soo-Mook Moon
Affiliations:
School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea;School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea;School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea
Venue:
The Computer Journal
Year:
2005

Citing 0
Cited 2

Efficient Register Mapping and Allocation in LaTTe, an Open-Source Java Just-in-Time Compiler

IEEE Transactions on Parallel and Distributed Systems
Object co-location and memory reuse for Java programs

ACM Transactions on Architecture and Code Optimization (TACO)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Memory allocation is an important part of modern programming languages, including garbage-collected languages such as Java. We propose a fast memory allocation scheme for Java using lazy worst fit (LWF), where pointer increment is used as the primary allocation method and worst fit is used as a backup. We evaluated LWF on a working Java virtual machine with non-moving garbage collection, and the results show that LWF is practically useful since the overhead of fit allocation and the amount of fragmentation are low.