Principles of Optimal Page Replacement
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A study of storage partitioning using a mathematical model of locality
Communications of the ACM
Estimates of distributions of random variables for certain computer communications traffic models
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Is automatic “folding” of programs efficient enough to displace manual?
Communications of the ACM
Interarrival statistics for time sharing systems
Communications of the ACM
RESOURCE ALLOCATION IN MULTIPROCESS COMPUTER SYSTEMS
RESOURCE ALLOCATION IN MULTIPROCESS COMPUTER SYSTEMS
Logical, internal, and physical reference behavior in CODASYL database systems
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Characterising program behaviour with phases and transitions
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The Stack Growth Function: Cache Line Reference Models
IEEE Transactions on Computers
Parallel program behavioral study on a shared-memory multiprocessor
ICS '91 Proceedings of the 5th international conference on Supercomputing
Synthetic Traces for Trace-Driven Simulation of Cache Memories
IEEE Transactions on Computers
A Model of Workloads and its Use in Miss-Rate Prediction for Fully Associative Caches
IEEE Transactions on Computers
ACM SIGMETRICS Performance Evaluation Review
Efficient procedure mapping using cache line coloring
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Workload models of VBR video traffic and their use in resource allocation policies
IEEE/ACM Transactions on Networking (TON)
Measurement and analysis of locality phases in file referencing behaviour
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
The independence of miss ratio on page size
Journal of the ACM (JACM)
An Approach to Program Behavior Modeling and Optimal Memory Control
Journal of the ACM (JACM)
Analysis of the Search Performance of Coalesced Hashing
Journal of the ACM (JACM)
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
A note on the calculation of average working set size
Communications of the ACM
TENEX, a paged time sharing system for the PDP - 10
Communications of the ACM
A study of storage partitioning using a mathematical model of locality
Communications of the ACM
Empirical working set behavior
Communications of the ACM
The effect of seance communication on multiprocessing systems
ACM Transactions on Computer Systems (TOCS)
An efficient profile-analysis framework for data-layout optimizations
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Managing Locality Sets: The Model and Fixed-Size Buffers
IEEE Transactions on Computers
The Multi-Queue Replacement Algorithm for Second Level Buffer Caches
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
DAC '72 Proceedings of the 9th Design Automation Workshop
Analytic modelling of “working set like” replacement algorithms
SIGMETRICS '79 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems
Characteristics and models of program behaviour
ACM '76 Proceedings of the 1976 annual conference
AGSICP: An Automated Grading System for the Instruction of Cobol Programming
ACM '73 Proceedings of the ACM annual conference
Multiprogramming under separate working-set principle
ACM '73 Proceedings of the ACM annual conference
On the self contained modelling of DB/DC systems
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
An analysis of the performance of the page fault frequency (PFF) replacement algorithm.
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
A study of program locality and lifetime functions
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
WSCLOCK—a simple and effective algorithm for virtual memory management
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Some considerations in database application programming
ICSE '76 Proceedings of the 2nd international conference on Software engineering
On reference string generation processes
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
A simple reference string sampling method
ACM '80 Proceedings of the ACM 1980 annual conference
Page size selection for a real time computer
ACM '75 Proceedings of the 1975 annual conference
A model hierarchy for virtual memory system investigation
WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
Second-Level Buffer Cache Management
IEEE Transactions on Parallel and Distributed Systems
Selecting Software Phase Markers with Code Structure Analysis
Proceedings of the International Symposium on Code Generation and Optimization
ACM '77 Proceedings of the 1977 annual conference
A distributed data caching framework for mobile ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Characteristics of workloads used in high performance and technical computing
Proceedings of the 21st annual international conference on Supercomputing
Hierarchical performance analysis models for data base systems
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
A Computer Resource Allocation Model with Some Measured and Simulation Results
IEEE Transactions on Computers
Computation of Cold-Start Miss Ratios
IEEE Transactions on Computers
Aspects of a Dynamically Adaptive Operating System
IEEE Transactions on Computers
A Modified Working Set Paging Algorithm
IEEE Transactions on Computers
Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison
IEEE Transactions on Computers
On the Paging Performance of Array Algorithms
IEEE Transactions on Computers
Approximate analysis of LRU in the case of short term correlations
Computer Networks: The International Journal of Computer and Telecommunications Networking
Accurate memory signatures and synthetic address traces for HPC applications
Proceedings of the 22nd annual international conference on Supercomputing
Journal of Systems Architecture: the EUROMICRO Journal
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A methodology for computer model building
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Experiments with program locality
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Experimental data on page replacement algorithm
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Balancing processor shares of scheduling classes through controlled allocation of memory
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Model for database reference strings based on behavior of reference clusters
IBM Journal of Research and Development
IBM Journal of Research and Development
Model for interactive data base reference string
IBM Journal of Research and Development
Dynamic partitioning of the main memory using the working set concept
IBM Journal of Research and Development
A strategy to emulate NOR flash with NAND flash
ACM Transactions on Storage (TOS)
Adaptive conflict unit size for distributed optimistic synchronization
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Detecting phases in parallel applications on shared memory architectures
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The RIM framework for image processing
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Working set characterization of applications with an efficient LRU algorithm
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
BW-DCache: an inexpensive, effective and reliable cache solution in a SAN file system
HPCS'09 Proceedings of the 23rd international conference on High Performance Computing Systems and Applications
Improving dynamic prediction accuracy through multi-level phase analysis
Proceedings of the 13th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, Tools and Theory for Embedded Systems
An analytical model for the LISP cache size
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 48.36 |
A program's working set W(t, T) at time t is the set of distinct pages among the T most recently referenced pages. Relations between the average working-set size, the missing-page rate, and the interreference-interval distribution may be derived both from time-average definitions and from ensemble-average (statistical) definitions. An efficient algorithm for estimating these quantities is given. The relation to LRU (lease recently used) paging is characterized. The independent-reference model, in which page references are statistically independent, is used to assess the effects of interpage dependencies on working-set size observations. Under general assumptions, working-set size is shown to be normally distributed.