Skip to main content

2013 | OriginalPaper | Buchkapitel

Generational Garbage Collection Policies

verfasst von : Xufeng Zhao, Syouji Nakamura, Cunhua Qian

Erschienen in: Stochastic Reliability and Maintenance Modeling

Verlag: Springer London

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
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.
 
Literatur
1.
Zurück zum Zitat Appel AW (1989) Simple generational garbage collection and fast allocation. Softw Pract Exper 19:171–183CrossRef Appel AW (1989) Simple generational garbage collection and fast allocation. Softw Pract Exper 19:171–183CrossRef
2.
Zurück zum Zitat 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 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
3.
Zurück zum Zitat Barlow RE, Proschan F (1965) Mathematical theory of reliability. Wiley, New YorkMATH Barlow RE, Proschan F (1965) Mathematical theory of reliability. Wiley, New YorkMATH
4.
Zurück zum Zitat Clinger WD, Rojas FV (2006) Linear combinations of radioactive decay models for generational garbage collection. Sci Comput Program 62:184–203MathSciNetMATHCrossRef Clinger WD, Rojas FV (2006) Linear combinations of radioactive decay models for generational garbage collection. Sci Comput Program 62:184–203MathSciNetMATHCrossRef
5.
Zurück zum Zitat Jones R, Lins R (1996) Garbage collection: algorithms for automatic dynamic memory management. Wiley, ChichesterMATH Jones R, Lins R (1996) Garbage collection: algorithms for automatic dynamic memory management. Wiley, ChichesterMATH
6.
Zurück zum Zitat Kaldewaij A, Vries L (2001) Optimal real-time garbage collection for acyclic pointer structures. Inf Process Lett 77:151–157MATHCrossRef Kaldewaij A, Vries L (2001) Optimal real-time garbage collection for acyclic pointer structures. Inf Process Lett 77:151–157MATHCrossRef
7.
Zurück zum Zitat Lee WH, Chang JM (2004) A garbage collection policy based on empirical behavior. Inf Sci 167:129–146MATHCrossRef Lee WH, Chang JM (2004) A garbage collection policy based on empirical behavior. Inf Sci 167:129–146MATHCrossRef
8.
Zurück zum Zitat Nakagawa T (2005) Maintenance theory of reliability. Springer, London Nakagawa T (2005) Maintenance theory of reliability. Springer, London
9.
Zurück zum Zitat Nakagawa T (2007) Shock and damage models in reliability theory. Springer, LondonMATH Nakagawa T (2007) Shock and damage models in reliability theory. Springer, LondonMATH
10.
Zurück zum Zitat Nakamura S, Nakagawa T (2010) Stochastic reliability modeling, optimization and applications. World Scientific, SingaporeMATH Nakamura S, Nakagawa T (2010) Stochastic reliability modeling, optimization and applications. World Scientific, SingaporeMATH
11.
Zurück zum Zitat Nikulin MS, Balakrishnan N (2010) Advances in degradation modeling: applications to reliability, survival analysis, and finanace. Birkhöuser, BostonCrossRef Nikulin MS, Balakrishnan N (2010) Advances in degradation modeling: applications to reliability, survival analysis, and finanace. Birkhöuser, BostonCrossRef
13.
14.
Zurück zum Zitat Satow T, Yasui K, Nakagawa T (1996) Optimal garbage collection policies for a database in a computer system. RAIRO Oper Res 30:359–372MATH Satow T, Yasui K, Nakagawa T (1996) Optimal garbage collection policies for a database in a computer system. RAIRO Oper Res 30:359–372MATH
15.
Zurück zum Zitat 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 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
16.
Zurück zum Zitat Soman S, Krintz C (2007) Application-specific garbage collection. J Syst Softw 80:1037–1056CrossRef Soman S, Krintz C (2007) Application-specific garbage collection. J Syst Softw 80:1037–1056CrossRef
17.
Zurück zum Zitat Ungar D (1984) Generation scavenging: A non-disruptive high performance storage reclamation algorithm. ACM Sigplan Not 19:157–167CrossRef Ungar D (1984) Generation scavenging: A non-disruptive high performance storage reclamation algorithm. ACM Sigplan Not 19:157–167CrossRef
18.
Zurück zum Zitat Ungar D, Jackson F (1992) An adaptive tenuring policy for generation scavengers. ACM Trans Program Lang Syst 14:1–27CrossRef Ungar D, Jackson F (1992) An adaptive tenuring policy for generation scavengers. ACM Trans Program Lang Syst 14:1–27CrossRef
19.
Zurück zum Zitat Vengerov D (2009) Modeling, analysis and throughput optimization of a generational garbage collector. Technical Report, Sun Labs, TR-2009-179 Vengerov D (2009) Modeling, analysis and throughput optimization of a generational garbage collector. Technical Report, Sun Labs, TR-2009-179
20.
Zurück zum Zitat 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 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
21.
Zurück zum Zitat 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 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
22.
Zurück zum Zitat 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 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
Metadaten
Titel
Generational Garbage Collection Policies
verfasst von
Xufeng Zhao
Syouji Nakamura
Cunhua Qian
Copyright-Jahr
2013
Verlag
Springer London
DOI
https://doi.org/10.1007/978-1-4471-4971-2_15

Neuer Inhalt