Article

Free access

An advisor for flexible working sets

Authors:

Raphael Alonso,

Andrew W. AppelAuthors Info & Claims

SIGMETRICS '90: Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Pages 153 - 162

https://doi.org/10.1145/98457.98753

Published: 01 April 1990 Publication History

PDF eReader

Abstract

The traditional model of virtual memory working sets does not account for programs that can adjust their working sets on demand. Examples of such programs are garbage-collected systems and databases with block cache buffers. We present a memory-use model of such systems, and propose a method that may be used by virtual memory managers to advise programs on how to adjust their working sets. Our method tries to minimize memory contention and ensure better overall system response time. We have implemented a memory “advice server” that runs as a non-privileged process under Berkeley Unix. User processes may ask this server for advice about working set sizes, so as to take maximum advantage of memory resources. Our implementation is quite simple, and has negligible overhead, and experimental results show that it results in sizable performance improvements.

References

[1]

Andrew W. Appel. Garbage collection can be faster than stack allocation. b,forvnalion Processing Letters, 25(4):275-279, 1987.

Digital Library

Google Scholar

[2]

Andrew W. Appel. Simple generational garbage collection and fast allocation. Soflware--Practice/Ezperience, 1989.

Digital Library

Google Scholar

[3]

Andrew W. Appel and David B. MacQueen. A Standard ML compiler. In Gilles Kahn, editor, Functional Programming Languages and Computer Architecture (LNCS 274), pages 301-324. Springer-Verlag, 1987.

Digital Library

Google Scholar

[4]

C. J. Cheney. A nonrecursive list compacting algorithm. Communications of the ACM, 13(11):677-678, 1970.

Digital Library

Google Scholar

[5]

Peter J. Denning. The working set model for program behavior. CACM, 11(5):323-333, 1968.

Digital Library

Google Scholar

[6]

Peter J. Denning. Working sets past and present. IEEE Trans. Software Engineering, SE-6(1):64-84, 1980.

Digital Library

Google Scholar

[7]

Robert R. Fenichel and Jerome C. Yoehelson. A LISP garbage-collector for virtual-memory computer systems. Communications of the ACM, 12(11):611-612, 1969.

Digital Library

Google Scholar

[8]

Henry Lieberman and Carl Hewitt. A real-time garbage collector based on the lifetimes of objects. Communications of the A CM, 23(6):419-429, 1983.

Digital Library

Google Scholar

Cited By

View all

Kirisame MShenoy PPanchekha P(2022)Optimal heap limits for reducing browser memory useProceedings of the ACM on Programming Languages10.1145/35633236:OOPSLA2(986-1006)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563323
Lion DChiu AYuan DBarbalace ABhatotia PAlvisi LCadar C(2021)M3Proceedings of the Sixteenth European Conference on Computer Systems10.1145/3447786.3456256(507-522)Online publication date: 21-Apr-2021
https://dl.acm.org/doi/10.1145/3447786.3456256
Ismail MSuh GMars JTang LXue JWu P(2020)Efficient nursery sizing for managed languages on multi-core processors with shared cachesProceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3368826.3377908(1-15)Online publication date: 22-Feb-2020
https://dl.acm.org/doi/10.1145/3368826.3377908
Show More Cited By

Index Terms

Recommendations

An advisor for flexible working sets

The traditional model of virtual memory working sets does not account for programs that can adjust their working sets on demand. Examples of such programs are garbage-collected systems and databases with block cache buffers. We present a memory-use ...
Loop-Aware Memory Prefetching Using Code Block Working Sets
MICRO-47: Proceedings of the 47th Annual IEEE/ACM International Symposium on Microarchitecture

Memory prefetchers predict streams of memory addresses that are likely to be accessed by recurring invocations of a static instruction. They identify an access pattern and prefetch the data that is expected to be accessed by pending invocations of the ...
Exploiting Core Working Sets to Filter the L1 Cache with Random Sampling

Locality is often characterized by working sets, defined by Denning as the set of distinct addresses referenced within a certain window of time. This definition ignores the fact that dramatic differences exist between the usage patterns of frequently ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGMETRICS '90: Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems

April 1990

273 pages

ISBN:0897913590

DOI:10.1145/98457

Chairman:
Gary J. Nutt
Univ. of Colorado, Boulder, CO

ACM SIGMETRICS Performance Evaluation Review Volume 18, Issue 1
May 1990
269 pages
ISSN:0163-5999
DOI:10.1145/98460
Editor:
M. K. Vernon
Issue’s Table of Contents

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 April 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

30
Total Citations
View Citations
437
Total Downloads

Downloads (Last 12 months)46
Downloads (Last 6 weeks)9

Reflects downloads up to 19 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kirisame MShenoy PPanchekha P(2022)Optimal heap limits for reducing browser memory useProceedings of the ACM on Programming Languages10.1145/35633236:OOPSLA2(986-1006)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563323
Lion DChiu AYuan DBarbalace ABhatotia PAlvisi LCadar C(2021)M3Proceedings of the Sixteenth European Conference on Computer Systems10.1145/3447786.3456256(507-522)Online publication date: 21-Apr-2021
https://dl.acm.org/doi/10.1145/3447786.3456256
Ismail MSuh GMars JTang LXue JWu P(2020)Efficient nursery sizing for managed languages on multi-core processors with shared cachesProceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3368826.3377908(1-15)Online publication date: 22-Feb-2020
https://dl.acm.org/doi/10.1145/3368826.3377908
Cameron CSinger JVengerov D(2015)The judgment of forseti: economic utility for dynamic heap sizing of multiple runtimesACM SIGPLAN Notices10.1145/2887746.275418050:11(143-156)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2887746.2754180
Cameron CSinger JVengerov DHosking ABond M(2015)The judgment of forseti: economic utility for dynamic heap sizing of multiple runtimesProceedings of the 2015 International Symposium on Memory Management10.1145/2754169.2754180(143-156)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2754169.2754180
Cameron CSinger J(2014)We are all economists nowProceedings of the 9th International Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems PLE10.1145/2633301.2633304(1-10)Online publication date: 28-Jul-2014
https://dl.acm.org/doi/10.1145/2633301.2633304
White DSinger JAitken JJones R(2013)Control theory for principled heap sizingACM SIGPLAN Notices10.1145/2555670.246648148:11(27-38)Online publication date: 20-Jun-2013
https://dl.acm.org/doi/10.1145/2555670.2466481
White DSinger JAitken JJones RCheng PPetrank E(2013)Control theory for principled heap sizingProceedings of the 2013 international symposium on memory management10.1145/2491894.2466481(27-38)Online publication date: 20-Jun-2013
https://dl.acm.org/doi/10.1145/2491894.2466481
Salomie TAlonso GRoscoe TElphinstone KHanzálek ZHärtig HCastro MKaashoek M(2013)Application level ballooning for efficient server consolidationProceedings of the 8th ACM European Conference on Computer Systems10.1145/2465351.2465384(337-350)Online publication date: 15-Apr-2013
https://dl.acm.org/doi/10.1145/2465351.2465384
White DSinger JAitken JJones RCheng PPetrank E(2013)Control theory for principled heap sizingProceedings of the 2013 international symposium on memory management10.1145/2464157.2466481(27-38)Online publication date: 20-Jun-2013
https://dl.acm.org/doi/10.1145/2464157.2466481
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

An advisor for flexible working sets

Loop-Aware Memory Prefetching Using Code Block Working Sets

Exploiting Core Working Sets to Filter the L1 Cache with Random Sampling