Skip to main content
SpringerLink
Log in
Book cover

Stochastic Reliability and Maintenance Modeling pp 333–360Cite as

Generational Garbage Collection Policies

  • Chapter
  • First Online:

Part of the book series: Springer Series in Reliability Engineering ((RELIABILITY,volume 9))

Abstract

In the computer science community, the technique of garbage collection [5] is an automatic process of memory recycling, which refers to those objects in the memory no longer referenced by programs are called garbage and should be thrown away. A garbage collector determines which objects are garbage and makes the heap space occupied by such garbage available again for the subsequent new objects. Garbage collection plays an important role in Java’s security strategy, however, it adds a large overhead that can deteriorate the program performances. From related studies which are summarized in [5], a garbage collector spends between 25 and 40 percent of execution time of programs for its work in general, and delays caused by such garbage collection are obtrusive.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    Tenuring collection is also a kind of minor collection [5]. We define tenuring collection as distinct from minor collection because there may be some surviving objects tenured from survivor space into Old.

References

  1. Appel AW (1989) Simple generational garbage collection and fast allocation. Softw Pract Exper 19:171–183

    Article  Google Scholar 

  2. Armstrong J, Virding R (1995) One-pass real-time generational mark-sweep garbage collection. In: Proceedings of international workshop on memory managementx (Lecture notes in computer science), vol 986. Springer, Berlin, pp 313–322

    Google Scholar 

  3. Barlow RE, Proschan F (1965) Mathematical theory of reliability. Wiley, New York

    MATH  Google Scholar 

  4. Clinger WD, Rojas FV (2006) Linear combinations of radioactive decay models for generational garbage collection. Sci Comput Program 62:184–203

    Article  MathSciNet  MATH  Google Scholar 

  5. Jones R, Lins R (1996) Garbage collection: algorithms for automatic dynamic memory management. Wiley, Chichester

    MATH  Google Scholar 

  6. Kaldewaij A, Vries L (2001) Optimal real-time garbage collection for acyclic pointer structures. Inf Process Lett 77:151–157

    Article  MATH  Google Scholar 

  7. Lee WH, Chang JM (2004) A garbage collection policy based on empirical behavior. Inf Sci 167:129–146

    Article  MATH  Google Scholar 

  8. Nakagawa T (2005) Maintenance theory of reliability. Springer, London

    Google Scholar 

  9. Nakagawa T (2007) Shock and damage models in reliability theory. Springer, London

    MATH  Google Scholar 

  10. Nakamura S, Nakagawa T (2010) Stochastic reliability modeling, optimization and applications. World Scientific, Singapore

    MATH  Google Scholar 

  11. Nikulin MS, Balakrishnan N (2010) Advances in degradation modeling: applications to reliability, survival analysis, and finanace. Birkhöuser, Boston

    Book  Google Scholar 

  12. Osaki S (1992) Applied stochastic system modeling. Springer, Berlin

    Book  MATH  Google Scholar 

  13. Ross SM (1983) Stochastic processes. Wiley, New York

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  15. Sato K (2001) Basic results on Lévy processes. In: Bandorff-Nielsen O, Mikosch T, Resnick S (eds) Lévy processes, theory and applications. Birkhöuser, Boston

    Google Scholar 

  16. Soman S, Krintz C (2007) Application-specific garbage collection. J Syst Softw 80:1037–1056

    Article  Google Scholar 

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

    Article  Google Scholar 

  18. Ungar D, Jackson F (1992) An adaptive tenuring policy for generation scavengers. ACM Trans Program Lang Syst 14:1–27

    Article  Google Scholar 

  19. Vengerov D (2009) Modeling, analysis and throughput optimization of a generational garbage collector. Technical Report, Sun Labs, TR-2009-179

    Google Scholar 

  20. Wilson PR (1992) Uniprocessor garbage collection techniques. In: International workshop on memory management, (Lecture notes in computer science), vol 637. Springer, London, pp 1–42

    Google Scholar 

  21. Zhao XF, Nakamura S, Nakagawa T (2010) Optimal policies for random and periodic garbage collections with tenuring threshold. In: Tomar GS, Chang RS, Gervasi O, Kim T, Bandyopadhyay SK (eds) vol 74 Communications in computers and information science. Springer, Berlin, pp 125–135

    Google Scholar 

  22. Zhao XF, Nakamura S, Nakagawa T (2011) Two generational garbage collection models with major collection time. IEICE transactions on fundamentals of electronics communications and computer sciences, E94-A:1558–1566

    Google Scholar 

Download references

Acknowledgments

This work is partially supported by the Grant-in-Aid for Scientific Research (C) of Japan Society for the Promotion of Science (22500897, 21530318), National Natural Science Foundation of China (70471017, 70801036) and Humanities and Social Science Research Foundation of China (05JA630027).

Author information

Authors and Affiliations

  1. Department of Business Administration, Aichi Institute of Technology, 1247 Yachigusa, Yakusa-cho, Toyota, 470-0392, Japan

    Xufeng Zhao

  2. Department of Human Life and Information, Kinjo Gakuin University, 1723 Omori 2-chome, Moriyama-ku, Nagoya, 463-8521, Japan

    Syouji Nakamura

  3. School of Economics and Management, Nanjing University of Technology, 30 Puzhu Road, 211816, Nanjing, China

    Cunhua Qian

Authors
  1. Xufeng Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Syouji Nakamura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cunhua Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xufeng Zhao .

Editor information

Editors and Affiliations

  1. , Department of Information Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739-8527, Japan

    Tadashi Dohi

  2. , Dept. of Business administration, Aichi Institute of Technology, Yachigusa, Yagusa-cho 1247, Toyota, 470-0392, Japan

    Toshio Nakagawa

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Zhao, X., Nakamura, S., Qian, C. (2013). Generational Garbage Collection Policies. In: Dohi, T., Nakagawa, T. (eds) Stochastic Reliability and Maintenance Modeling. Springer Series in Reliability Engineering, vol 9. Springer, London. https://doi.org/10.1007/978-1-4471-4971-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4971-2_15

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4970-5

  • Online ISBN: 978-1-4471-4971-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation