Java Memory Allocation with Lazy Worst Fit for Small Objects

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

Full description

Saved in:
Bibliographic Details
Published in:Computer journal 2005-01, Vol.48 (4), p.437-442
Main Author: Choi, H.-K.
Format: Article
Language:English
Subjects:
Computer memory
Computer science
Field representatives
FIFO
Java
LIFO
Programming languages
Sanitation services
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.[PUBLICATION ABSTRACT]
ISSN:0010-4620
1460-2067
DOI:10.1093/comjnl/bxh101