Skip to main content

Optimal Policies for Random and Periodic Garbage Collections with Tenuring Threshold

  • Conference paper
Advanced Computer Science and Information Technology (AST 2010)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jones, R., Lins, R.: Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, Chichester (1996)

    MATH  Google Scholar 

  2. Ungar, D.: Generation scavenging: A non-disruptive high performance storage reclamation algorithm. ACM Sigplan Notices 19, 157–167 (1984)

    Article  Google Scholar 

  3. Vengerov, D.: Modeling, analysis and throughput optimization of a generational garbage collector. Technical Report, Sun Labs (2009)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. Satow, T., Yasui, K., Nakagawa, T.: Optimal garbage collection policies for a database in a computer system. RAIRO Operations Research 30, 359–372 (1996)

    MATH  Google Scholar 

  6. Nakagawa, T.: Shock and Damage Models in Reliability Theory. Springer, London (2007)

    MATH  Google Scholar 

  7. Nakagawa, T.: Maintenance Theory of Reliability. Springer, London (2005)

    Google Scholar 

  8. Nakamura, S., Nakagawa, T.: Stochastic Reliability Modeling, Optimization and Applications. World Scientific, Singapore (2010)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics