Determining an Optimal Secondary Storage Service Rate for the PASM Control System
IEEE Transactions on Computers
An Empirical Study of Task Switching Locality in MVS
IEEE Transactions on Computers
Analysis of block-paging strategies
IBM Journal of Research and Development
Estimating the fault rate function
IBM Systems Journal
Coscheduling under Memory Constraints in a NOW Environment
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
A Short Theory of Multiprogramming
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Experimental Results on Statistical Approaches to Page Replacement Policies
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
MemTo: A Memory Monitoring Tool for a Linux Cluster
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Improving performance by cache driven memory management
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
Parallel implementation of a transportation network model
Journal of Parallel and Distributed Computing
On paging with locality of reference
Journal of Computer and System Sciences
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
Detecting anomalous records in categorical datasets
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Youtube traffic characterization: a view from the edge
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
CRAMM: virtual memory support for garbage-collected applications
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Effectiveness of Private Caches in Multiprocessor Systems with Parallel-Pipelined Memories
IEEE Transactions on Computers
Effects of Cache Coherency in Multiprocessors
IEEE Transactions on Computers
BI batch manager: a system for managing batch workloads on enterprise data-warehouses
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Design trade-offs for search engine caching
ACM Transactions on the Web (TWEB)
Prefetch throttling and data pinning for improving performance of shared caches
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Profiler and compiler assisted adaptive I/O prefetching for shared storage caches
Proceedings of the 17th international conference on Parallel architectures and compilation techniques
Program locality analysis using reuse distance
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
Reducing splaying by taking advantage of working sets
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Generalized ERSS tree model: Revisiting working sets
Performance Evaluation
ARC: a self-tuning, low overhead replacement cache
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
How to fit program footprint curves
Proceedings of the 2011 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
Low cost working set size tracking
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
A survey analysis of memory elasticity techniques
Euro-Par 2010 Proceedings of the 2010 conference on Parallel processing
Outperforming LRU via competitive analysis on parametrized inputs for paging
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Modelling contention sensing memory management systems: A VAX/VMS case study
Mathematical and Computer Modelling: An International Journal
Cache Conscious Task Regrouping on Multicore Processors
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
AI-Ckpt: leveraging memory access patterns for adaptive asynchronous incremental checkpointing
Proceedings of the 22nd international symposium on High-performance parallel and distributed computing
Relative interval analysis of paging algorithms on access graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.02 |
A program's working set is the collection of segments (or pages) recently referenced. This concept has led to efficient methods for measuring a program's intrinsic memory demand; it has assisted in undetstanding and in modeling program behavior; and it has been used as the basis of optimal multiprogrammed memory management. The total cost of a working set dispatcher is no larger than the total cost of other common dispatchers. This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance.