Abstract
Garbage collection represents an important feature of many modern systems that allows programmers to avoid explicit memory management and related common errors. However, its usage introduces problems in software performance engineering, because on the one hand the system exhibits better performances when there is low memory occupancy and on the other hand the garbage collection activity blocks other processes, so it may introduce a performance drawback.
We propose a queueing model to analyse a system with a garbage collector, where customers arrive according to a Poisson process and the service time distribution depends on the amount of free memory. Customer arrivals correspond to process activations in the system. The model parameters allow one to specify the garbage collector service rate, and the distribution of the delays between successive activations.
We show that the process underlying such a queueing model is a Quasi-Birth-Death stochastic process and we derive the steady-state analysis via Matrix Geometric Methods. Finally, we propose a heuristic based on this model to derive an appropriate and effective garbage collector activation rate in order to minimise the average system response time. The parametrisation is done using system statistics.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bini, D., Meini, B., Steffé, S., Van Houdt, B.: Structured Markov chains solver: software tools. In: Proc. of the 2006 Workshop on tools for Solving Structured Markov Chains, p. 14. ACM Press, New York (2006)
Gelenbe, E.: On the optimum checkpoint interval. J. ACM 26, 259–270 (1979)
Hertz, M., Berger, E.D.: Quantifying the performance of garbage collection vs. explicit memory management. SIGPLAN Not. 40(10), 313–326 (2005)
Jones, R., Lins, R.: Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester (1996)
Kant, K.: Introduction to Computer System Performance Evaluation. McGraw-Hill, New York (1992)
Latouche, G., Ramaswami, V.: Introduction to Matrix Anlytic Methods in Stochastic Modeling. Statistics and applied probability ASA-SIAM, Philadelphia, PA(1999)
Latouche, G., Ramaswami, Y.: A logaritmic reduction algorithm for Quasi Birth and Death processes. J. of Appl. Prob. 30, 650–674 (1994)
Neuts, M.F.: Matrix Geometric Solutions in Stochastic Models. John Hopkins, Baltimore (1981)
Neuts, M.F.: Structured stochastic matrices of M/G/1 type and their application. Marcel Dekker, New York (1989)
Schoeberl, M., Puffitsch, W.: Nonblocking real-time garbage collection. ACM Trans. Embed. Comput. Syst. 10(1), 1–28 (2010)
Sun Microsystem: Memory Management in the Java HotSpot Virtual Machine (April 2006)
Vaidyanathan, K., Trivedi, K.: A comprehensive model for software rejuvenation. IEEE Trans. on Dependable and Secure Comput. 2(2), 124–137 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balsamo, S., Dei Rossi, GL., Marin, A. (2011). Optimisation of Virtual Machine Garbage Collection Policies. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2011. Lecture Notes in Computer Science, vol 6751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21713-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-21713-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21712-8
Online ISBN: 978-3-642-21713-5
eBook Packages: Computer ScienceComputer Science (R0)