Properties of the working-set model
Communications of the ACM
Operating Systems Theory
ACM Transactions on Computer Systems (TOCS)
Tradeoffs in supporting two page sizes
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Transient-free working-set statistics
Communications of the ACM
Anomalies with variable partition paging algorithms
Communications of the ACM
Generalized working sets for segment reference strings
Communications of the ACM
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
The implications of working set analysis on supercomputing memory hierarchy design
Proceedings of the 19th annual international conference on Supercomputing
IEEE Transactions on Computers
The impact of caching on search engines
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
A Modified Working Set Paging Algorithm
IEEE Transactions on Computers
Design trade-offs for search engine caching
ACM Transactions on the Web (TWEB)
| Hi-index | 48.27 |
Finite-length reference string of arbitrary structure are considered, and an exact expression for average working set size in terms of “corrected” interreference interval statistics is derived. An example is discussed; upper and lower bounds are obtained; and the average working set size function is shown to be efficiently obtained for a set of page sizes, in a single pass of the reference string.This work follows the developments of a paper by Denning and Schwartz, who consider infinite-length reference strings which satisfy certain statistical properties and who derive an expression relating the asymptotic average working set size to the asymptotic missing page rate function under working set replacement.