• DocumentCode
    1992671
  • Title

    Do generational schemes improve the garbage collection efficiency?

  • Author

    Srisa-an, W. ; Chang, J. Morris ; Lo, Chiu-lien Dan

  • Author_Institution
    Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    58
  • Lastpage
    63
  • Abstract
    Recently, most research efforts on garbage collection have concentrated on reducing pause times. However, very little effort has been spent on the study of garbage collection efficiency, especially generational garbage collection which was introduced as a way to reduce garbage collection pause times. In this paper a detailed study of garbage collection efficiency in generational schemes is presented. The study provides a mathematical model for the efficiency of generation garbage collection. Additionally, important issues such as write-barrier overhead, pause times, residency, and heap size are also addressed. We find that generational garbage collection often has lower garbage collection efficiency than other approaches (e.g. mark-sweep, copying) due to a smaller collected area and write-barrier overhead
  • Keywords
    storage management; generational garbage collection efficiency; heap size; mathematical model; pause time; residency; write-barrier overhead; Computer science; Human computer interaction; Java; Programming profession;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Performance Analysis of Systems and Software, 2000. ISPASS. 2000 IEEE International Symposium on
  • Conference_Location
    Austin, TX
  • Print_ISBN
    0-7803-6418-X
  • Type

    conf

  • DOI
    10.1109/ISPASS.2000.842282
  • Filename
    842282