Java Memory Allocation with Lazy Worst Fit for Small Objects (2005)
| Venue: | The Computer Journal |
| Citations: | 1 - 0 self |
BibTeX
@ARTICLE{Choi05javamemory,
author = {Hyung-kyu Choi and Yoo C. Chung and Soo-mook Moon},
title = {Java Memory Allocation with Lazy Worst Fit for Small Objects},
journal = {The Computer Journal},
year = {2005},
volume = {48},
pages = {437--442}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Memory allocation is an important part of modern programming languages, including garbagecollected 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. 1.
