Generational Garbage Collection Policies
In the computer science community, the technique of garbage collection  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 , 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.
KeywordsCollection Time Cost Rate Garbage Collection Pause Time Garbage Collector
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).
- 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
- 8.Nakagawa T (2005) Maintenance theory of reliability. Springer, LondonGoogle 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, BostonGoogle Scholar
- 19.Vengerov D (2009) Modeling, analysis and throughput optimization of a generational garbage collector. Technical Report, Sun Labs, TR-2009-179Google 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–42Google 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–135Google 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–1566Google Scholar