On the public citation graph
Virtual Memory Management
0 signed · 76 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.4380050404openalex-snapshot
Evaluation of markov program models in virtual memory systems
inferredcites →https://doi.org/10.1002/spe.4380100705openalex-snapshot
Multiprogramming and memory contention
inferredcites →https://doi.org/10.1007/978-1-4757-3510-9_8openalex-snapshot
An Experimental Time-Sharing System
inferredcites →https://doi.org/10.1093/comjnl/15.1.51openalex-snapshot
Simulation of a Paging Computer System
inferredcites →https://doi.org/10.1109/afips.1968.173openalex-snapshot
Thrashing, its Causes and Prevention
inferredcites →https://doi.org/10.1109/c-m.1976.218435openalex-snapshot
Distance String Models for Program Behavior
inferredcites →https://doi.org/10.1109/proc.1975.9857openalex-snapshot
Multiprogrammed memory management
inferredcites →https://doi.org/10.1109/proc.1975.9859openalex-snapshot
Analytic modeling of interactive systems
inferredcites →https://doi.org/10.1109/proc.1975.9861openalex-snapshot
Adaptive optimization of a time-sharing system's performance
inferredcites →https://doi.org/10.1109/tc.1973.5009115openalex-snapshot
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
inferredcites →https://doi.org/10.1109/tc.1976.1674715openalex-snapshot
A Modified Working Set Paging Algorithm
inferredcites →https://doi.org/10.1109/tse.1980.230464openalex-snapshot
Working Sets Past and Present
inferredcites →https://doi.org/10.1145/1007773.809369openalex-snapshot
The optimal choice of window sizes for working set dispatching
inferredcites →https://doi.org/10.1145/1013610.807307openalex-snapshot
Run-time characteristics of a simulation model
inferredcites →https://doi.org/10.1145/1041753.1041757openalex-snapshot
A simulation study of adaptive scheduling policies in interactive computer systems
inferredcites →https://doi.org/10.1145/1067625.806555openalex-snapshot
Analysis of demand paging policies with swapped working sets
inferredcites →https://doi.org/10.1145/1067629.806539openalex-snapshot
A study of program locality and lifetime functions
inferredcites →https://doi.org/10.1145/321662.321675openalex-snapshot
A Dynamic Time-Sharing Priority Queue
inferredcites →https://doi.org/10.1145/321796.321800openalex-snapshot
Some Distribution-Free Aspects of Paging Algorithm Performance
inferredcites →https://doi.org/10.1145/321796.321801openalex-snapshot
Finding Optimal Demand Paging Algorithms
inferredcites →https://doi.org/10.1145/321879.321887openalex-snapshot
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
inferredcites →https://doi.org/10.1145/355620.361167openalex-snapshot
A note on the calculation of average working set size
inferredcites →https://doi.org/10.1145/358818.358821openalex-snapshot
A virtual machine emulator for performance evaluation
inferredcites →https://doi.org/10.1145/360860.360863openalex-snapshot
On the construction of a representative synthetic workload
inferredcites →https://doi.org/10.1145/360924.360926openalex-snapshot
A simple linear model of demand paging performance
inferredcites →https://doi.org/10.1145/361268.361280openalex-snapshot
A study of storage partitioning using a mathematical model of locality
inferredcites →https://doi.org/10.1145/361532.361554openalex-snapshot
A model of memory contention in a paging machine
inferredcites →https://doi.org/10.1145/362003.362032openalex-snapshot
The design, implementation, and evaluation of a working set dispatcher
inferredcites →https://doi.org/10.1145/362835.362847openalex-snapshot
Some criteria for time-sharing system performance
inferredcites →https://doi.org/10.1145/362946.363002openalex-snapshot
Dynamic space-sharing in computer systems
inferredcites →https://doi.org/10.1145/363095.363141openalex-snapshot
The working set model for program behavior
inferredcites →https://doi.org/10.1145/363427.363436openalex-snapshot
The simulation of time sharing systems
inferredcites →https://doi.org/10.1145/800001.811668openalex-snapshot
Virtual memory, processes, and sharing in Multics
inferredcites →https://doi.org/10.1145/800212.806492openalex-snapshot
TENEX, a paged time sharing system for the PDP-10
inferredcites →https://doi.org/10.1145/800212.806511openalex-snapshot
Properties of the working-set model
inferredcites →https://doi.org/10.1145/800213.806515openalex-snapshot
How to evaluate page replacement algorithms
inferredcites →https://doi.org/10.1145/800213.806539openalex-snapshot
A study of program locality and lifetime functions
inferredcites →https://doi.org/10.1145/800214.806555openalex-snapshot
Analysis of demand paging policies with swapped working sets
inferredcites →https://doi.org/10.1145/800277.809369openalex-snapshot
The optimal choice of window sizes for working set dispatching
inferredcites →https://doi.org/10.1145/961053.961105openalex-snapshot
Performance monitors for multi-programming systems
inferredcites →https://doi.org/10.1147/rd.161.0058openalex-snapshot
Experiments on Page Size, Program Access Patterns, and Virtual Memory Performance
inferredcites →https://doi.org/10.1147/rd.175.0387openalex-snapshot
Characterization of Program Paging in a Time-sharing Environment
inferredcites →https://doi.org/10.1147/rd.175.0404openalex-snapshot
An Analysis of Page Allocation Strategies for Multiprogramming Systems with Virtual Memory
inferredcites →https://doi.org/10.1147/rd.195.0445openalex-snapshot
Dynamic Partitioning of the Main Memory Using the Working Set Concept
inferredcites →https://doi.org/10.1147/rd.195.0451openalex-snapshot
Study of Memory Partitioning for Multiprogramming Systems with Virtual Memory
inferredcites →https://doi.org/10.1147/rd.225.0498openalex-snapshot
An Analytic Model of the VM/370 System
inferredcites →https://doi.org/10.1147/sj.123.0302openalex-snapshot
Experimental evaluation of system performance
inferredcites →https://doi.org/10.1147/sj.52.0078openalex-snapshot
A study of replacement algorithms for a virtual-storage computer
inferredcites →https://doi.org/10.1147/sj.82.0136openalex-snapshot
A pseudo-random number generator for the System/360
inferredcites →https://doi.org/10.1147/sj.92.0078openalex-snapshot
Evaluation techniques for storage hierarchies
inferredcites →https://doi.org/10.1147/sj.93.0189openalex-snapshot
A heuristic approach to task dispatching
inferredcites →https://doi.org/10.2307/3008937openalex-snapshot
Introduction to Operating System Design
inferredcites →https://doi.org/10.5555/800246.807355openalex-snapshot
A simulation based model of a virtual storage system
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-7091-8871-2_3openalex-snapshot
Fault Tolerance in Tandem Computer Systems
inferred← citeshttps://doi.org/10.1007/bf01158786openalex-snapshot
Workstation performance as a function of local memory in distributed environments
inferred← citeshttps://doi.org/10.1016/0164-1212(91)90088-nopenalex-snapshot
Program I/O behavior: Models and their applications
inferred← citeshttps://doi.org/10.1016/j.peva.2005.01.007openalex-snapshot
A page fault equation for modeling the effect of memory size
inferred← citeshttps://doi.org/10.1023/a:1015398403337openalex-snapshot
Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms*
inferred← citeshttps://doi.org/10.1109/ccgrid51090.2021.00067openalex-snapshot
A Holistic System Software Integration of Disaggregated Memory for Next-Generation Cloud Infrastructures
inferred← citeshttps://doi.org/10.1109/fitme.2009.105openalex-snapshot
The Research on the Dynamic Paging Algorithm Based on Working Set
inferred← citeshttps://doi.org/10.1109/icsme.2017.15openalex-snapshot
Embroidery: Patching Vulnerable Binary Code of Fragmentized Android Devices
inferred← citeshttps://doi.org/10.1109/rttas.2001.929865openalex-snapshot
A feedback control approach for guaranteeing relative delays in Web servers
inferred← citeshttps://doi.org/10.1109/wcse.2009.699openalex-snapshot
Resident Set Management and Realize
inferred← citeshttps://doi.org/10.1109/wnis.2009.18openalex-snapshot
The Implementation of Protection and Safe Mechanisms Base on Internal Access Authorization Policy
inferred← citeshttps://doi.org/10.1145/1067627.806596openalex-snapshot
WSCLOCK—a simple and effective algorithm for virtual memory management
inferred← citeshttps://doi.org/10.1145/3126509openalex-snapshot
Application-Aware Swapping for Mobile Systems
inferred← citeshttps://doi.org/10.1145/512429.512445openalex-snapshot
Adaptive caching for demand prepaging
inferred← citeshttps://doi.org/10.1145/773039.512445openalex-snapshot
Adaptive caching for demand prepaging
inferred← citeshttps://doi.org/10.4271/952577openalex-snapshot
Macro Replacement Algorithms for J1939/72 Virtual Terminals
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.