Generational Garbage Collection Policies

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


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.


Collection Time Cost Rate Garbage Collection Pause Time Garbage Collector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



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


  1. 1.
    Appel AW (1989) Simple generational garbage collection and fast allocation. Softw Pract Exper 19:171–183CrossRefGoogle Scholar
  2. 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–322Google Scholar
  3. 3.
    Barlow RE, Proschan F (1965) Mathematical theory of reliability. Wiley, New YorkMATHGoogle Scholar
  4. 4.
    Clinger WD, Rojas FV (2006) Linear combinations of radioactive decay models for generational garbage collection. Sci Comput Program 62:184–203MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Jones R, Lins R (1996) Garbage collection: algorithms for automatic dynamic memory management. Wiley, ChichesterMATHGoogle Scholar
  6. 6.
    Kaldewaij A, Vries L (2001) Optimal real-time garbage collection for acyclic pointer structures. Inf Process Lett 77:151–157MATHCrossRefGoogle Scholar
  7. 7.
    Lee WH, Chang JM (2004) A garbage collection policy based on empirical behavior. Inf Sci 167:129–146MATHCrossRefGoogle Scholar
  8. 8.
    Nakagawa T (2005) Maintenance theory of reliability. Springer, LondonGoogle Scholar
  9. 9.
    Nakagawa T (2007) Shock and damage models in reliability theory. Springer, LondonMATHGoogle Scholar
  10. 10.
    Nakamura S, Nakagawa T (2010) Stochastic reliability modeling, optimization and applications. World Scientific, SingaporeMATHGoogle Scholar
  11. 11.
    Nikulin MS, Balakrishnan N (2010) Advances in degradation modeling: applications to reliability, survival analysis, and finanace. Birkhöuser, BostonCrossRefGoogle Scholar
  12. 12.
    Osaki S (1992) Applied stochastic system modeling. Springer, BerlinMATHCrossRefGoogle Scholar
  13. 13.
    Ross SM (1983) Stochastic processes. Wiley, New YorkMATHGoogle Scholar
  14. 14.
    Satow T, Yasui K, Nakagawa T (1996) Optimal garbage collection policies for a database in a computer system. RAIRO Oper Res 30:359–372MATHGoogle Scholar
  15. 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, BostonGoogle Scholar
  16. 16.
    Soman S, Krintz C (2007) Application-specific garbage collection. J Syst Softw 80:1037–1056CrossRefGoogle Scholar
  17. 17.
    Ungar D (1984) Generation scavenging: A non-disruptive high performance storage reclamation algorithm. ACM Sigplan Not 19:157–167CrossRefGoogle Scholar
  18. 18.
    Ungar D, Jackson F (1992) An adaptive tenuring policy for generation scavengers. ACM Trans Program Lang Syst 14:1–27CrossRefGoogle Scholar
  19. 19.
    Vengerov D (2009) Modeling, analysis and throughput optimization of a generational garbage collector. Technical Report, Sun Labs, TR-2009-179Google Scholar
  20. 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–42Google Scholar
  21. 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–135Google Scholar
  22. 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–1566Google Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.Department of Business AdministrationAichi Institute of TechnologyToyotaJapan
  2. 2.Department of Human Life and InformationKinjo Gakuin UniversityNagoyaJapan
  3. 3.School of Economics and ManagementNanjing University of TechnologyNanjingChina

Personalised recommendations