Abstract
It is an important problem to determine the tenuring threshold to meet the pause time goal for a generational garbage collector. From such viewpoint, this paper proposes two stochastic models based on the working schemes of a generational garbage collector: One is random collection which occurs at a nonhomogeneous Poisson process and the other is periodic collection which occurs at periodic times. Since the cost suffered for minor collection increases, as the amount of surviving objects accumulates, tenuring minor collection should be made at some tenuring threshold. Using the techniques of cumulative processes and reliability theory, expected cost rates with tenuring threshold are obtained, and optimal policies which minimize them are discussed analytically and computed numerically.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jones, R., Lins, R.: Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, Chichester (1996)
Ungar, D.: Generation scavenging: A non-disruptive high performance storage reclamation algorithm. ACM Sigplan Notices 19, 157–167 (1984)
Vengerov, D.: Modeling, analysis and throughput optimization of a generational garbage collector. Technical Report, Sun Labs (2009)
Armstrong, J., Virding, R.: One-pass real-time generational mark-sweep garbage collection. In: Baker, H.G. (ed.) IWMM-GIAE 1995. LNCS, vol. 986. Springer, Heidelberg (1995)
Satow, T., Yasui, K., Nakagawa, T.: Optimal garbage collection policies for a database in a computer system. RAIRO Operations Research 30, 359–372 (1996)
Nakagawa, T.: Shock and Damage Models in Reliability Theory. Springer, London (2007)
Nakagawa, T.: Maintenance Theory of Reliability. Springer, London (2005)
Nakamura, S., Nakagawa, T.: Stochastic Reliability Modeling, Optimization and Applications. World Scientific, Singapore (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, X., Nakamura, S., Nakagawa, T. (2010). Optimal Policies for Random and Periodic Garbage Collections with Tenuring Threshold. In: Tomar, G.S., Chang, RS., Gervasi, O., Kim, Th., Bandyopadhyay, S.K. (eds) Advanced Computer Science and Information Technology. AST 2010. Communications in Computer and Information Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13346-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-13346-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13345-9
Online ISBN: 978-3-642-13346-6
eBook Packages: Computer ScienceComputer Science (R0)