default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 30 matches
- 2024
- Sari Sultan, Kia Shakiba, Albert Lee, Paul Chen, Michael Stumm:
TTLs Matter: Efficient Cache Sizing with TTL-Aware Miss Ratio Curves and Working Set Sizes. EuroSys 2024: 387-404 - 2023
- Rong Gu, Simian Li, Haipeng Dai, Hancheng Wang, Yili Luo, Bin Fan, Ran Ben Basat, Ke Wang, Zhenyu Song, Shouwei Chen, Beinan Wang, Yihua Huang, Guihai Chen:
Adaptive Online Cache Capacity Optimization via Lightweight Working Set Size Estimation at Scale. USENIX ATC 2023: 467-484 - Zhilu Lian, Yangzi Li, Zhixiang Chen, Shiwen Shan, Baoxin Han, Yuxin Su:
eBPF-based Working Set Size Estimation in Memory Management. CoRR abs/2303.05919 (2023) - 2022
- Zhilu Lian, Yangzi Li, Zhixiang Chen, Shiwen Shan, Baoxin Han, Yuxin Su:
eBPF-based Working Set Size Estimation in Memory Management. ICSS 2022: 188-195 - 2021
- Stella Bitchebe, Djob Mvondo, Laurent Réveillère, Noël De Palma, Alain Tchana:
Extending Intel PML for hardware-assisted working set size estimation of VMs. VEE 2021: 111-124 - 2020
- Shili Peng, Qinghua Hu, Jianwu Dang, Wenwu Wang:
Optimal feasible step-size based working set selection for large scale SVMs training. Neurocomputing 407: 366-375 (2020) - 2019
- Ahmed A. Harby, Sherif Fadel Fahmy, Ahmed F. Amin:
More Accurate Estimation of Working Set Size in Virtual Machines. IEEE Access 7: 94039-94047 (2019) - 2018
- Vlad Nitu, Aram Kocharyan, Hannas Yaya, Alain Tchana, Daniel Hagimont, Hrachya V. Astsatryan:
Working Set Size Estimation Techniques in Virtualized Environments: One Size Does not Fit All. Proc. ACM Meas. Anal. Comput. Syst. 2(1): 19:1-19:22 (2018) - Jingyuan Hu, Xiaokuang Bai, Sai Sha, Yingwei Luo, Xiaolin Wang, Zhenlin Wang:
Working Set Size Estimation with Hugepages in Virtualization. ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018: 501-508 - Vlad Nitu, Aram Kocharyan, Hannas Yaya, Alain Tchana, Daniel Hagimont, Hrachya V. Astsatryan:
Working Set Size Estimation Techniques in Virtualized Environments: One Size Does not Fit All. SIGMETRICS (Abstracts) 2018: 62-63 - 2015
- Jui-Hao Chiang, Tzi-cker Chiueh, Han-Lin Li:
Memory Reclamation and Compression Using Accurate Working Set Size Estimation. CLOUD 2015: 187-194 - 2014
- Seong Jin Cho, Seung Hyun Yun, Jae Wook Jeon:
A roofline model based on working set size for embedded systems. IEICE Electron. Express 11(15): 20140560 (2014) - Aparna Mandke Dani, Bharadwaj Amrutur, Y. N. Srikant:
Toward a Scalable Working Set Size Estimation Method and Its Application for Chip Multiprocessors. IEEE Trans. Computers 63(6): 1567-1579 (2014) - 2013
- Anna Melekhova:
Machine Learning in Virtualization: Estimate a Virtual Machine's Working Set Size. IEEE CLOUD 2013: 863-870 - 2011
- Weiming Zhao, Xinxin Jin, Zhenlin Wang, Xiaolin Wang, Yingwei Luo, Xiaoming Li:
Low Cost Working Set Size Tracking. USENIX ATC 2011 - 2007
- Darryl Gove:
CPU2006 working set size. SIGARCH Comput. Archit. News 35(1): 90-96 (2007) - 2006
- Tatjana Eitrich, Bruno Lang:
On The Optimal Working Set Size in Serial and Parallel Support Vector Machine Learning With The Decomposition Algorithm. AusDM 2006: 121-128 - 2000
- Magnus Karlsson, Per Stenström:
An analytical model of the working-set sizes in decision-support systems. SIGMETRICS 2000: 275-285 - 1993
- Edward Rothberg, Jaswinder Pal Singh, Anoop Gupta:
Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors. ISCA 1993: 14-25 - 1990
- Kwangkeun Yi, Luddy Harrison:
On-the-fly circuit to measure the average working set size. ICCD 1990: 471-474 - 1983
- C. R. Dutt, D. Ferrari:
Characterizing and reproducing working set size dynamics. Perform. Evaluation 3(3): 197-210 (1983) - Domenico Ferrari:
Working set size strings. Perform. Evaluation 3(2): 152-153 (1983) - Tzong-yu Paul Lee:
Experimental design of a generative model based on working set size characterizations. Perform. Evaluation 3(2): 151-152 (1983) - Tzong-yu Paul Lee:
The properties and limiting behavior of working set size strings and flat-faults. Perform. Evaluation 3(2): 152 (1983) - 1982
- Micha Hofri, Percy Tzelnic:
The Working Set Size Distribution for the Markov Chain Model of Program Behavior. SIAM J. Comput. 11(3): 453-466 (1982) - 1979
- Micha Hofri, Percy Tzelnic:
On the Working Set Size for the Markov Chain Model of Program Behaviour. Performance 1979: 393-405 - 1978
- D. Kropp, H. Wrobel:
Working set size reduction by restructuring APL workspaces. ECI 1978: 460-473 - 1975
- Peter Bryant:
Predicting Working Set Sizes. IBM J. Res. Dev. 19(3): 221-229 (1975) - 1974
- Donald R. Slutz, Irving L. Traiger:
A Note on the Calculation Working Set Size. Commun. ACM 17(10): 563-565 (1974) - Greg Henderson, Juan Rodriguez-Rosell:
The optimal choice of window sizes for working set dispatching. SIGMETRICS 1974: 10-33
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-25 10:45 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint