File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Skew-space garbage collection

TitleSkew-space garbage collection
Authors
KeywordsGarbage Collection
Mark Compact
Semi Space
Skew Space
Space Efficiency
Issue Date2013
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/scico
Citation
Science Of Computer Programming, 2013, v. 78 n. 5, p. 445-457 How to Cite?
AbstractSemispace garbage collectors relocate all the live objects in one step, which is simple and leads to good performance. Compared with mark-compact collectors, however, they need to reserve extra heap space for copying live objects. As much as half of the heap could be reserved as it is possible that all the allocated objects survive. In reality, however, most programs exhibit a high infant mortality, and therefore reserving half the heap is wasteful. We have observed that the memory usage of many ordinary programs is relatively stable over the course of their execution. This provides an opportunity for online predictions to dynamically adjust and optimize the reserved space. Consequently, we propose a skew-space garbage collector that reserves space dynamically. This collector is implemented using the MMTk framework of the Jikes RVM and gives encouraging results against related garbage collection algorithms for the DaCapo and SPECjvm98 benchmarks. © 2011 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/152461
ISSN
2015 Impact Factor: 0.828
2015 SCImago Journal Rankings: 0.570
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorTong, Len_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-06-26T06:39:21Z-
dc.date.available2012-06-26T06:39:21Z-
dc.date.issued2013en_US
dc.identifier.citationScience Of Computer Programming, 2013, v. 78 n. 5, p. 445-457en_US
dc.identifier.issn0167-6423en_US
dc.identifier.urihttp://hdl.handle.net/10722/152461-
dc.description.abstractSemispace garbage collectors relocate all the live objects in one step, which is simple and leads to good performance. Compared with mark-compact collectors, however, they need to reserve extra heap space for copying live objects. As much as half of the heap could be reserved as it is possible that all the allocated objects survive. In reality, however, most programs exhibit a high infant mortality, and therefore reserving half the heap is wasteful. We have observed that the memory usage of many ordinary programs is relatively stable over the course of their execution. This provides an opportunity for online predictions to dynamically adjust and optimize the reserved space. Consequently, we propose a skew-space garbage collector that reserves space dynamically. This collector is implemented using the MMTk framework of the Jikes RVM and gives encouraging results against related garbage collection algorithms for the DaCapo and SPECjvm98 benchmarks. © 2011 Elsevier B.V. All rights reserved.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/scicoen_US
dc.relation.ispartofScience of Computer Programmingen_US
dc.subjectGarbage Collectionen_US
dc.subjectMark Compacten_US
dc.subjectSemi Spaceen_US
dc.subjectSkew Spaceen_US
dc.subjectSpace Efficiencyen_US
dc.titleSkew-space garbage collectionen_US
dc.typeArticleen_US
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.scico.2011.06.003en_US
dc.identifier.scopuseid_2-s2.0-84875224715en_US
dc.identifier.isiWOS:000317544500003-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridTong, L=35114041500en_US
dc.identifier.scopusauthoridLau, FCM=7102749723en_US
dc.identifier.citeulike9621040-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats