View in EDS PDF Full Text

Implementation and evaluation of adaptive garbage collection.

Saved in:
Bibliographic Details
Title: Implementation and evaluation of adaptive garbage collection.
Authors: Takaoka, Eiko1, Tanaka, Yoshio2, Nakanishi, Masakazu3
Source: Systems & Computers in Japan. 12/1/2000, Vol. 31 Issue 14, p83-90. 8p.
Subjects: Garbage collection (Computer science), Computer memory management, LISP (Computer program language), Programming languages, Computer science, Computer systems
Abstract: Some garbage collection (GC) algorithms use a given threshold to control their behavior. Objects are classified according to their lifetimes, and the optimum threshold is used to efficiently collect unnecessary objects. Determining the approximate threshold value is crucial to such algorithms because the threshold value has a strong influence on the algorithm efficiency. Since memory usage depends on how intensively applications are being run, it is necessary to dynamically adjust the threshold. Demographic feedback-mediated tenuring (DFMT) is an algorithm that adjusts the threshold dynamically according to cell usage pattern. In this scheme, permanent objects are copied repeatedly in the space for the young generation. Our adaptive garbage collection (AGC) is an efficient garbage collection algorithm that solves this problem. AGC adjusts the threshold dynamically according to the fraction of cells used. We propose GC cost as a measure for quantitatively evaluating the efficiency of generation-dependent garbage collection with the copy scheme, and compare AGC and FGC (GC using DFMT). We show that AGC performs more efficiently for most applications. © 2000 Scripta Technica, Syst Comp Jpn, 31(14): 83–90, 2000 [ABSTRACT FROM AUTHOR]
Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 13380362
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Implementation and evaluation of adaptive garbage collection.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Takaoka%2C+Eiko%22">Takaoka, Eiko</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Tanaka%2C+Yoshio%22">Tanaka, Yoshio</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Nakanishi%2C+Masakazu%22">Nakanishi, Masakazu</searchLink><relatesTo>3</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Systems+%26+Computers+in+Japan%22">Systems & Computers in Japan</searchLink>. 12/1/2000, Vol. 31 Issue 14, p83-90. 8p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Garbage+collection+%28Computer+science%29%22">Garbage collection (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+memory+management%22">Computer memory management</searchLink><br /><searchLink fieldCode="DE" term="%22LISP+%28Computer+program+language%29%22">LISP (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+science%22">Computer science</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Some garbage collection (GC) algorithms use a given threshold to control their behavior. Objects are classified according to their lifetimes, and the optimum threshold is used to efficiently collect unnecessary objects. Determining the approximate threshold value is crucial to such algorithms because the threshold value has a strong influence on the algorithm efficiency. Since memory usage depends on how intensively applications are being run, it is necessary to dynamically adjust the threshold. Demographic feedback-mediated tenuring (DFMT) is an algorithm that adjusts the threshold dynamically according to cell usage pattern. In this scheme, permanent objects are copied repeatedly in the space for the young generation. Our adaptive garbage collection (AGC) is an efficient garbage collection algorithm that solves this problem. AGC adjusts the threshold dynamically according to the fraction of cells used. We propose GC cost as a measure for quantitatively evaluating the efficiency of generation-dependent garbage collection with the copy scheme, and compare AGC and FGC (GC using DFMT). We show that AGC performs more efficiently for most applications. © 2000 Scripta Technica, Syst Comp Jpn, 31(14): 83–90, 2000 [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=13380362
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1002/1520-684X(200012)31:14<83::AID-SCJ10>3.0.CO;2-7
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 8
        StartPage: 83
    Subjects:
      – SubjectFull: Garbage collection (Computer science)
        Type: general
      – SubjectFull: Computer memory management
        Type: general
      – SubjectFull: LISP (Computer program language)
        Type: general
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Computer science
        Type: general
      – SubjectFull: Computer systems
        Type: general
    Titles:
      – TitleFull: Implementation and evaluation of adaptive garbage collection.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Takaoka, Eiko
      – PersonEntity:
          Name:
            NameFull: Tanaka, Yoshio
      – PersonEntity:
          Name:
            NameFull: Nakanishi, Masakazu
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: 12/1/2000
              Type: published
              Y: 2000
          Identifiers:
            – Type: issn-print
              Value: 08821666
          Numbering:
            – Type: volume
              Value: 31
            – Type: issue
              Value: 14
          Titles:
            – TitleFull: Systems & Computers in Japan
              Type: main
ResultId 1