Bibliographic Details
| Title: |
Mark without much Sweep Algorithm for Garbage Collection. |
| Alternate Title: |
Algoritam za zbrinjavanje memorije s označavanjem i smanjenim oslobađanjem. |
| Authors: |
Basch, Danko1 danko.basch@fer.hr, Ivančić, Dorian2 dorian.ivancic@gmail.com, Hlupić, Nikica3 nikica.hlupić@fer.hr |
| Source: |
Automatika: Journal for Control, Measurement, Electronics, Computing & Communications. Oct-Dec2014, Vol. 55 Issue 4, p514-525. 12p. |
| Subjects: |
Garbage collection (Computer science), Computer memory management, Heuristic algorithms, Algorithm research, Fast sweeping methods (Mathematics) |
| Abstract (English): |
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. [ABSTRACT FROM AUTHOR] |
| Abstract (Croatian): |
U ovom članku opisana su dva jednostavna poboljšanja algoritma označi-oslobodi. Osnovna ideja jest smještanje malih objekata istog tipa u pretince. Pretinci su organizirani tako da se u njima ne pojavljuje unutarnja fragmentacija, a uklanja se i potreba za oslobađanjem blokova zauzetih nedohvatljivim objektima. Vrijeme provedeno u zbrinjavanju manje je za 19% u odnosu na klasični algoritam označi-oslobodi. Drugo poboljšanje je općenitije i moguće gaje primijeniti i na druge algoritme za zbrinjavanje memorije. U njemu rastom gomile upravlja heuristički algoritam koji koristi pravilnosti u ponašanju objekata različitih tipova. Na temelju njih, algoritam odlučuje hoće li gomila biti zbrinuta ili odmah proširena. Heuristička inačica algoritma smanjuje vrijeme provedeno u zbrinjavanju u odnosu na tradicionalni algoritam označi-oslobodi za 49%, a da pri tome zahtijeva približno istu količinu memorije. [ABSTRACT FROM AUTHOR] |
|
Copyright of Automatika: Journal for Control, Measurement, Electronics, Computing & Communications is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
