Mark and split

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Sagonas, K en
dc.contributor.author Wilhelmsson, J en
dc.date.accessioned 2014-03-01T02:44:05Z
dc.date.available 2014-03-01T02:44:05Z
dc.date.issued 2006 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/31669
dc.subject Java en
dc.subject Mark-and-split en
dc.subject Mark-and-sweep en
dc.subject Non-moving garbage collectors en
dc.subject.other Adaptive systems en
dc.subject.other Benchmarking en
dc.subject.other Costs en
dc.subject.other Standards en
dc.subject.other Storage allocation (computer) en
dc.subject.other Mark and split en
dc.subject.other Mark and sweep en
dc.subject.other Nonmoving garbage collectors en
dc.subject.other Algorithms en
dc.title Mark and split en
heal.type conferenceItem en
heal.identifier.primary 10.1145/1133956.1133961 en
heal.identifier.secondary http://dx.doi.org/10.1145/1133956.1133961 en
heal.publicationDate 2006 en
heal.abstract The mark-sweep garbage collection algorithm constructs a list of memory areas to allocate into (the free list) during its sweep phase. This phase needs time proportional to the size of the heap which is collected. We introduce mark-split, a non-moving garbage collection algorithm that constructs the free list during the mark phase by maintaining and splitting free intervals. With mark-split, the sweep phase of mark-sweep becomes unnecessary and the cost of collection is proportional to the size of the live data set. Our performance evaluation, using a high performance Java implementation running standard benchmarks, shows that mark-split can significantly reduce collection times compared with mark-sweep and requires little extra space to do so. The overhead to the cost of marking is moderate and often pays off for itself by avoiding the sweep phase. Since there is no guarantee that this is always the case, we also propose adaptive schemes that try to combine the best performance characteristics of mark-split and mark-sweep collection. Copyright © 2006 ACM. en
heal.journalName International Symposium on Memory Management, ISMM en
dc.identifier.doi 10.1145/1133956.1133961 en
dc.identifier.volume 2006 en
dc.identifier.spage 29 en
dc.identifier.epage 39 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record