Mark without much Sweep Algorithm for Garbage Collection (CROSBI ID 215304)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Basch, Danko ; Ivančić, Dorian ; Hlupić, Nikica
engleski
Mark without much Sweep Algorithm for Garbage Collection
In this paper two simple improvements over traditional mark-sweep collector are proposed. The core idea is placing small objects of the same type in buckets. The buckets are organised in such way to eliminate the internal fragmentation, sweeping, and freeing inside them. The measured improvement of garbage collection time over traditional mark-sweep is 19%. Another proposed improvement is more general and is applicable to other garbage collection algorithms as well. It uses heuristics to control the heap growth. The regularities in behaviour of objects of particular types are used to determine whether the collection should be performed or avoided in favour of immediate heap expansion. The heap expansion algorithm reduces garbage collection time over traditional marksweep for 49% while keeping the heap size approximately the same.
Mark-sweep; Garbage collection; Heap sizing; Memory management
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
55 (4)
2014.
514-525
objavljeno
0005-1144
10.7305/automatika.2014.11.857