article

Free access

Tenuring policies for generation-based storage reclamation

Authors:

Frank JacksonAuthors Info & Claims

ACM SIGPLAN Notices, Volume 23, Issue 11

Pages 1 - 17

https://doi.org/10.1145/62084.62085

Published: 01 January 1988 Publication History

Abstract

One of the most promising automatic storage reclamation techniques, generation-based storage reclamation, suffers poor performance if many objects live for a fairly long time and then die. We have investigated the severity of this problem by simulating Generation Scavenging automatic storage reclamation from traces of actual four-hour sessions. There was a wide variation in the sample runs, with garbage-collection overhead ranging from insignificant, during the interactive runs, to severe, during a single non-interactive run. All runs demonstrated that performance could be improved with two techniques: segregating large bitmaps and strings, and mediating tenuring with demographic feedback. These two improvements deserve consideration for any generation-based storage reclamation strategy.

References

[1]

H. G. Baker, "List Processing in Real Time on a Serial Computer," A.I. Working Paper 139, MIT-AI Lab, Boston, MA, April 1977.-

[2]

Kent Beck, private communication, March, 1988.

[3]

G. E. Collins, "A Method for Overlapping and Erasure of Lists," ommumcations of the ACM 3, 12, December 1960, 655--657.

Digital Library

[4]

George Bosworth,private communication, March, 1988.

[5]

D. R. Brownbridge, Recursive Structures in Computer Systems, doctoral dissertation, University of Newcastle upon Tyne, September, 1984.

[6]

Patrick J. Caudill, Allen Wirfs-Brock "A Third Generation Smalltalk-80 Implementation," OOPSLA "86 Conference Pr6ceedings, Portland OR, 1986, 119-130. Also blished as ACM SIGPLAN Notices 21, 11, Nov.

Digital Library

[7]

L. Peter Deutsch and Daniel G. Bobrow, "An Efficient Incremental Automatic Garba~,e Collection," Communications of the ACM '9, 9, Sept. 1976, 522-526.

Digital Library

[8]

L. Peter Deutsch and Allan M. Schiffman, "Efficient Implementation of the Smalltalk-80 System," Proceedings of the 11th Annual ACM Symposium on tl(e Principles of Programming Languages, Salt Lake City, Utah, January 1984.

Digital Library

[9]

Richard J. Fateman, private communication, 1983.

[10]

John K. Foderaro and Richard J. Fateman, "Characterization of VAX Maxsyma," Proceedings of the 1981 ACM Symposium on Symbolic and Algebraic Computation, Berkeley, CA, 1981, pp. 14-19.

Digital Library

[11]

Adele Goldberg and David Robson, Smalltalk-80: The Ean~ge and its Implementation, Addison-Wesley, Reading, MA, 1983__

Digital Library

[12]

Billy Joel, "Only the Good Die Young," in Billy Joel Greatest Hits, ASCAP, 1977.

[13]

Ted Kaehler, Glenn Krasner, LOOM--Large Obje~.,t--Oriented Memory for Smalltalk-80 Systems, in Smailtalk--80: t~its of History, Words of Advice, G. Krasner (ed.), Addison-Wesley, Reading, MA, 1983, 251-271

[14]

John Lennon, Paul McCartney "She Said She Said," Revolver, BMI, 1966.

[15]

John Lennon with Paul McCartney, "A Day in the Life/" Sgt. Pepper's Lonely Hearts Club Band, BMI, 1967.

[16]

John Lennon, "Good Morning," Sgt. Pepper's Lonely Hearts Club Band, BMI, 1967.

[17]

John Lennon, "Lucy in the Sky with Diamonds," Sgt. Pepper's Lonely Hearts Club Band, BMI, 1967.

[18]

John Lennon and Paul McCartney, "With a Little Help From My Friends," Sgt. Pepper's Lonely Hearts Club Band, BMI, 1967.

[19]

Henry Lieberman and Carl Hewitt, "A Real-Time Garbage Collection Based on the Lifetimes of Objects," Communications of the ACM, 26, 6, June 1983, pp. 419429.

Digital Library

[20]

Paul McCartney, "Fixing a Hole," Sgt. Pepper s Lonely Hearts Club Band, BMI, 1967.

[21]

Paul McCartney, "Getting Better," Sgt. Pepper's Lonely Hearfs Club Ban~, BMI, 1967.

[22]

Paul McCartney, "When I'm Sixty-Four, Sgt. Pepper's Lonely Hearts Club Ban//, BMI, 1967.

[23]

J. McCarthy, "Recursive Functions of S ymbohc Expressions and Their Computation by Machine, I," Communications of the ACM 3, 1960, pp. 184-195.

Digital Library

[24]

David A. Moon, "Architecture of the S c~bolics 3600," Twelfth Annual International ayml2oszum on Computer Architecture, Boston, MA, June 1985, pp. 76-83.

Digital Library

[25]

James W. Stamos, "A Large Object- Oriented Virtual Memory: Grouping, Measurements, and Performance," Xerox technical report, SCG-82-2, Xerox, PARC, Palo Alto, CA, May 1982.

[26]

James W. Stamos, "Static Grouping of Small Objects to Enhance Performance of a Paged Virtual Memory," ACM Transactions on Computer Science 2,3, May 1984, 155-180.

Digital Library

[27]

Thomas A. Standish, Data Structure Techniques, Addison-Wesley, 1980, pp. 220-225.

Digital Library

[28]

David Ungar, "Generation Scavenging: A Non-Disruptive High Performance Storage Reclamation Algorithm,-" Proceedings of the ACM Symposium on Practical Software Development Environments, Pittsburgh, PA, April 198~4, pp. 157-167. Also published as ACM SIGPLAN Notices 19,5, May 1984 and ACM Software Engineering Notes 9, 3, May 1984.

Digital Library

[29]

David Ungar, The Design and Evaluation of a High Performance SmalltaBc System, ACM 1986 Distinguished Dissertation, MIT Press, Cambridge, ~A, 1987, 250 pages

Digital Library

Cited By

Tavakolisomeh S(2020)Selecting a JVM Garbage Collector for Big Data and Cloud ServicesProceedings of the 21st International Middleware Conference Doctoral Symposium10.1145/3429351.3431745(22-25)Online publication date: 7-Dec-2020
https://dl.acm.org/doi/10.1145/3429351.3431745
Bruno RFerreira P(2018)A Study on Garbage Collection Algorithms for Big Data EnvironmentsACM Computing Surveys10.1145/315681851:1(1-35)Online publication date: 10-Jan-2018
https://dl.acm.org/doi/10.1145/3156818
Tong LLau F(2013)Skew-space garbage collectionScience of Computer Programming10.1016/j.scico.2011.06.00378:5(445-457)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1016/j.scico.2011.06.003
Show More Cited By

Index Terms

Tenuring policies for generation-based storage reclamation
1. Information systems
  1. Information storage systems
    1. Storage management
2. Software and its engineering
  1. Software notations and tools
    1. Development frameworks and environments
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        File systems management
        Memory management

Recommendations

An adaptive tenuring policy for generation scavengers

One of the more promising automatic storage reclamation techniques, generation scavenging, suffers poor performance if many objects live for a fairly long time and then die. We have investigated the severity of this problem by simulating a two-...
Tenuring policies for generation-based storage reclamation
OOPSLA '88: Conference proceedings on Object-oriented programming systems, languages and applications

One of the most promising automatic storage reclamation techniques, generation-based storage reclamation, suffers poor performance if many objects live for a fairly long time and then die. We have investigated the severity of this problem by simulating ...
Compiler-directed storage reclamation using object lifetime analysis

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 23, Issue 11

Special issue: 'OOPSLA 88 Conference Proceedings

Nov. 1988

353 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/62084

Editor:
Norman Meyorwitz

Issue’s Table of Contents

OOPSLA '88: Conference proceedings on Object-oriented programming systems, languages and applications
January 1988
390 pages
ISBN:0897912845
DOI:10.1145/62083
Editor:
Norman Meyrowitz

Copyright © 1988 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1988

Published in SIGPLAN Volume 23, Issue 11

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

79
Total Citations
View Citations
331
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)5

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Tavakolisomeh S(2020)Selecting a JVM Garbage Collector for Big Data and Cloud ServicesProceedings of the 21st International Middleware Conference Doctoral Symposium10.1145/3429351.3431745(22-25)Online publication date: 7-Dec-2020
https://dl.acm.org/doi/10.1145/3429351.3431745
Bruno RFerreira P(2018)A Study on Garbage Collection Algorithms for Big Data EnvironmentsACM Computing Surveys10.1145/315681851:1(1-35)Online publication date: 10-Jan-2018
https://dl.acm.org/doi/10.1145/3156818
Tong LLau F(2013)Skew-space garbage collectionScience of Computer Programming10.1016/j.scico.2011.06.00378:5(445-457)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1016/j.scico.2011.06.003
Tong LLau FKrall AMössenböck H(2010)Exploiting memory usage patterns to improve garbage collections in JavaProceedings of the 8th International Conference on the Principles and Practice of Programming in Java10.1145/1852761.1852768(39-48)Online publication date: 15-Sep-2010
https://dl.acm.org/doi/10.1145/1852761.1852768
Khedker USanyal A(2009)Garbage Collection TechniquesThe Compiler Design Handbook10.1201/9781420043839.ch6(6-1-6-35)Online publication date: 7-Dec-2009
https://doi.org/10.1201/9781420043839.ch6
Marion SJones RRyder CMorrisett GSagiv M(2007)Decrypting the Java gene poolProceedings of the 6th international symposium on Memory management10.1145/1296907.1296918(67-78)Online publication date: 21-Oct-2007
https://dl.acm.org/doi/10.1145/1296907.1296918
Brecht TArjomandi ELi CPham H(2006)Controlling garbage collection and heap growth to reduce the execution time of Java applicationsACM Transactions on Programming Languages and Systems10.1145/1152649.115265228:5(908-941)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.1145/1152649.1152652
Printezis TJones R(2002)GCspyACM SIGPLAN Notices10.1145/583854.58245137:11(343-358)Online publication date: 4-Nov-2002
https://dl.acm.org/doi/10.1145/583854.582451
Printezis TJones RIbrahim MMatsuoka S(2002)GCspyProceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications10.1145/582419.582451(343-358)Online publication date: 4-Nov-2002
https://dl.acm.org/doi/10.1145/582419.582451
Stefanović DMcKinley KMoss J(1999)Age-based garbage collectionACM SIGPLAN Notices10.1145/320385.32042534:10(370-381)Online publication date: 1-Oct-1999
https://dl.acm.org/doi/10.1145/320385.320425
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents