Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,957,431 papers from all fields of science
Search
Sign In
Create Free Account
Working set size
Known as:
WSS
In computing, working set size is the amount of memory needed to compute the answer to a problem. In any computing scenario, but especially high…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Algorithm
Resident set size
Thrashing (computer science)
Working set
Broader (1)
Computer memory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Fast Virtual Machine Resume for Agile Cloud Services
Thomas Knauth
,
C. Fetzer
International Conference on Cloud and Green…
2013
Corpus ID: 6696434
Resuming virtual machines is an important management operation in the virtualized data center. (Re)-instantiating VMs as quickly…
Expand
2008
2008
Model-guided empirical tuning of loop fusion
Apan Qasem
,
K. Kennedy
International Journal of High Performance Systems…
2008
Corpus ID: 31760184
Loop fusion is recognised as an effective transformation for improving memory hierarchy performance. However, unconstrained loop…
Expand
2004
2004
Energy-efficiency potential of a phase-based cache resizing scheme for embedded systems
Gilles A. Pokam
,
F. Bodin
Eighth Workshop on Interaction between Compilers…
2004
Corpus ID: 8537805
Managing the energy-performance tradeoff has become a major challenge with embedded systems. The cache hierarchy is a typical…
Expand
2002
2002
Permutation Development Data Layout (PDDL) Disk Array Declustering
T. Schwarz
,
J. Steinberg
,
W. Burkhard
2002
Corpus ID: 18529498
Declustered data organizations have been proposed to achieve less-intrusive reconstruction of a failed disk’s contents. In…
Expand
2000
2000
Cache-Aware Multigrid Methods for Solving Poisson's Equation in Two Dimensions
M. Kowarschik
,
U. Rüde
,
Christian Weiß
,
Wolfgang Karl
Computing
2000
Corpus ID: 12174815
Abstract Conventional implementations of iterative numerical algorithms, especially multigrid methods, merely reach a…
Expand
1997
1997
Analytical Prediction of Performance for Cache Coherence Protocols
S. Srbljic
,
Z. Vranesic
,
M. Stumm
,
L. Budin
IEEE Trans. Computers
1997
Corpus ID: 16591712
In this paper, we introduce new analytical models for predicting the performance of parallel applications under various cache…
Expand
1981
1981
A generative model of working set dynamics
D. Ferrari
Measurement and Modeling of Computer Systems
1981
Corpus ID: 17456247
An algorithm for generating a page reference string which exhibits a given working set size behavior in the time domain is…
Expand
1977
1977
Transient-free working-set statistics
M. Easton
,
B. T. Bennett
CACM
1977
Corpus ID: 16093193
Transient-free average working-set size and transient-free missing-page rate for a finite sample of a reference string are…
Expand
Highly Cited
1976
Highly Cited
1976
A Modified Working Set Paging Algorithm
A. Smith
IEEE transactions on computers
1976
Corpus ID: 6686846
The working set paging algorithm is known to be highly efficient, yet has the disadvantage that during changes of locality large…
Expand
1975
1975
Predicting Working Set Sizes
Peter Bryant
IBM Journal of Research and Development
1975
Corpus ID: 579105
Empirical analyses of data on working set size are reported. The data do not support the hypothesis that working set sizes are…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE