The working set model for program behavior

By Peter J. Denning. 1968

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Optimization & Training

Citations in the corpus

FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness (2022, methodology): “We draw the most direct connection to the literature of analyzing I/O complexity in this work [1], but concepts of memory hierarchies are fundamental and has appeared in many forms, from the working set model [20], to data locality [83], to the Roofline model of arithmetic intensity [82], to analyse”
CFLRU: a replacement algorithm for flash memory (2006, methodology): “In online algorithms, the LRU [11, 12] algorithm is widely used.”
Cooperative Caching for Chip Multiprocessors (2006, methodology): “As an example, local memory management policies (such as the WS policy used in Windows operation systems) ensure that each thread has enough pages to hold its working set [34] and only replace pages from a thread’s local page pool.”
Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches (2006, background): “1Demand is determined by the number of unique cache blocks accessed in a given interval [4].”
Online algorithms: a survey (2003, background): “Recently, Albers et al. [7] proposed another framework for modeling locality of reference that goes back again to the working set concept by Denning [ 49 , 50].”
Post-copy based live virtual machine migration using adaptive pre-paging and dynamic self-ballooning (2009, methodology): “Pre-Paging: Pre-paging is a technique for hiding the latency of page faults (and in general I/O accesses in the critical execution path) by predicting the future working set (5) and loading the required pages before they are accessed.”