Izvorni znanstveni članak
https://doi.org/10.7305/automatika.2014.11.857
Mark without much Sweep Algorithm for Garbage Collection
Danko Basch
; Departement of Control and Computer Engineering, Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, HR-10000, Zagreb, Croatia
Dorian Ivancic
orcid.org/0000-0002-1192-7245
; Croatia osiguranje d.d. Miramarska 22, HR-10000, Zagreb, Croatia
Nikica Hlupic
orcid.org/0000-0002-2791-2961
; Departement of Applied Computing, Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, HR-10000, Zagreb, Croatia
Sažetak
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 mark-sweep for 49% while keeping the heap size approximately the same.
Ključne riječi
Mark-sweep; Garbage collection; Heap sizing; Memory Management
Hrčak ID:
133207
URI
Datum izdavanja:
12.1.2015.
Posjeta: 1.883 *