Singer, Jeremy and Jones, Richard E. and Brown, Gavin and Luján, Mikel (2010) The Economics of Garbage Collection. In: Vitek, Jan and Lea, Doug, eds. ISMM '10 Proceedings of the 2010 international symposium on Memory management. ACM, New York, USA, pp. 182-196. ISBN 978-1-4503-0054-4. (doi:10.1145/1806651.1806669) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:30660)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1145/1806651.1806669 |
Abstract
This paper argues that economic theory can improve our understanding of memory management. We introduce the allocation curve, as an analogue of the demand curve from microeconomics. An allocation curve for a program characterises how the amount of garbage collection activity required during its execution varies in relation to the heap size associated with that program. The standard treatment of microeconomic demand curves (shifts and elasticity) can be applied directly and intuitively to our new allocation curves. As an application of this new theory, we show how allocation elasticity can be used to control the heap growth rate for variable sized heaps in Jikes RVM.
Item Type: | Book section |
---|---|
DOI/Identification number: | 10.1145/1806651.1806669 |
Uncontrolled keywords: | determinacy analysis, Craig interpolants |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Richard Jones |
Date Deposited: | 21 Sep 2012 09:49 UTC |
Last Modified: | 16 Nov 2021 10:08 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/30660 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):