On the public citation graph
Locality in Page Reference Strings
0 signed · 77 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/nav.3800180402openalex-snapshot
Control variable methods in the simulation of a model of a multiprogrammed computer system
inferredcites →https://doi.org/10.1111/j.2517-6161.1961.tb00395.xopenalex-snapshot
The Solution of Queueing and Inventory Models by Semi-Markov Processes
inferredcites →https://doi.org/10.1145/321623.321632openalex-snapshot
Principles of Optimal Page Replacement
inferredcites →https://doi.org/10.1145/321637.321642openalex-snapshot
A Cyclic-Queue Model of System Overhead in Multiprogrammed Computer Systems
inferredcites →https://doi.org/10.1145/361532.361554openalex-snapshot
A model of memory contention in a paging machine
inferredcites →https://doi.org/10.1147/sj.92.0078openalex-snapshot
Evaluation techniques for storage hierarchies
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119285441.ch7openalex-snapshot
Discrete‐Time Markov Chains
inferred← citeshttps://doi.org/10.1006/jcss.1997.1498openalex-snapshot
Paging against a Distribution and IP Networking
inferred← citeshttps://doi.org/10.1007/3-540-11604-4_49openalex-snapshot
Program behavior and its models
inferred← citeshttps://doi.org/10.1007/3-540-44808-x_5openalex-snapshot
Experimental Results on Statistical Approaches to Page Replacement Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_28openalex-snapshot
Data Structures on Event Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_22openalex-snapshot
Formal Reasoning about Classified Markov Chains in HOL
inferred← citeshttps://doi.org/10.1007/978-3-662-49192-8_22openalex-snapshot
The Complexity of Paging Against a Probabilistic Adversary
inferred← citeshttps://doi.org/10.1007/bf00288657openalex-snapshot
A decomposable model of program paging behaviour
inferred← citeshttps://doi.org/10.1007/pl00009192openalex-snapshot
A Unified Analysis of Paging and Caching
inferred← citeshttps://doi.org/10.1007/s00453-013-9838-4openalex-snapshot
Data Structures on Event Graphs
inferred← citeshttps://doi.org/10.1007/s00454-009-9170-6openalex-snapshot
Markov Incremental Constructions
inferred← citeshttps://doi.org/10.1007/s11390-014-1460-7openalex-snapshot
Performance Metrics and Models for Shared Cache
inferred← citeshttps://doi.org/10.1016/0020-0255(76)90052-9openalex-snapshot
Optimal control of demand-paging systems
inferred← citeshttps://doi.org/10.1016/0166-5316(84)90005-1openalex-snapshot
Strategy independent program restructuring using the critical reference principle
inferred← citeshttps://doi.org/10.1016/j.comnet.2004.01.004openalex-snapshot
Modeling correlations in web traces and implications for designing replacement policies
inferred← citeshttps://doi.org/10.1016/j.jss.2006.07.021openalex-snapshot
Quantifying software performance, reliability and security: An architecture-based approach
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.1109/12.135552openalex-snapshot
Synthetic traces for trace-driven simulation of cache memories
inferred← citeshttps://doi.org/10.1109/32.7627openalex-snapshot
An analysis of some problems in managing virtual memory systems with fast secondary storage devices
inferred← citeshttps://doi.org/10.1109/c-m.1976.218435openalex-snapshot
Distance String Models for Program Behavior
inferred← citeshttps://doi.org/10.1109/infocom.2006.307openalex-snapshot
Modeling Locality of Reference via Notions of Positive Dependence - Some Mixed News
inferred← citeshttps://doi.org/10.1109/mascot.1995.378685openalex-snapshot
Program modelling via inter-reference gaps and applications
inferred← citeshttps://doi.org/10.1109/pdis.1996.568672openalex-snapshot
Characterizing reference locality in the WWW
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365674openalex-snapshot
IP over connection-oriented networks and distributional paging
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492476openalex-snapshot
A unified analysis of paging and caching
inferred← citeshttps://doi.org/10.1109/tc.1979.1675302openalex-snapshot
Use Bit Scanning in Replacement Decisions
inferred← citeshttps://doi.org/10.1109/tse.1979.230200openalex-snapshot
Structuring Programs for Efficient Operation in Virtual Memory Systems
inferred← citeshttps://doi.org/10.1109/tse.1980.230464openalex-snapshot
Working Sets Past and Present
inferred← citeshttps://doi.org/10.1137/s0097539792236353openalex-snapshot
Strongly Competitive Algorithms for Paging with Locality of Reference
inferred← citeshttps://doi.org/10.1137/s0097539794261817openalex-snapshot
Optimal Prediction for Prefetching in the Worst Case
inferred← citeshttps://doi.org/10.1145/1006209.1006213openalex-snapshot
Inter-reference gap distribution replacement
inferred← citeshttps://doi.org/10.1145/1013610.807296openalex-snapshot
A dynamic clustering strategy in a demand paging environment
inferred← citeshttps://doi.org/10.1145/103418.103422openalex-snapshot
Competitive paging with locality of reference
inferred← citeshttps://doi.org/10.1145/1041853.1041857openalex-snapshot
A note on computer system data gathering
inferred← citeshttps://doi.org/10.1145/1041853.1041858openalex-snapshot
Performance prediction of a virtual machine
inferred← citeshttps://doi.org/10.1145/1041864.1041870openalex-snapshot
Performance of a virtual memory
inferred← citeshttps://doi.org/10.1145/1067629.806516openalex-snapshot
An analysis of the performance of the page fault frequency (PFF) replacement algorithm.
inferred← citeshttps://doi.org/10.1145/1067629.806539openalex-snapshot
A study of program locality and lifetime functions
inferred← citeshttps://doi.org/10.1145/1071021.1071046openalex-snapshot
Architecture based analysis of performance, reliability and security of software systems
inferred← citeshttps://doi.org/10.1145/1377676.1377701openalex-snapshot
Markov incremental constructions
inferred← citeshttps://doi.org/10.1145/1980022.1980116openalex-snapshot
First-in not referenced first-out page replacement algorithm
inferred← citeshttps://doi.org/10.1145/223586.223620openalex-snapshot
An inter-reference gap model for temporal locality in program behavior
inferred← citeshttps://doi.org/10.1145/223587.223620openalex-snapshot
An inter-reference gap model for temporal locality in program behavior
inferred← citeshttps://doi.org/10.1145/225058.225280openalex-snapshot
Randomized and multipointer paging with locality of reference
inferred← citeshttps://doi.org/10.1145/258612.258681openalex-snapshot
Adaptive page replacement based on memory reference behavior
inferred← citeshttps://doi.org/10.1145/258623.258681openalex-snapshot
Adaptive page replacement based on memory reference behavior
inferred← citeshttps://doi.org/10.1145/323627.323638openalex-snapshot
Compiler directed memory management policy for numerical programs
inferred← citeshttps://doi.org/10.1145/359619.359634openalex-snapshot
Cold-start vs. warm-start miss ratios
inferred← citeshttps://doi.org/10.1145/360051.360234openalex-snapshot
Analysis of the PFF replacement algorithm via a semi-Markov model
inferred← citeshttps://doi.org/10.1145/360924.360928openalex-snapshot
Computation of page fault probability from program transition diagram
inferred← citeshttps://doi.org/10.1145/775406.775409openalex-snapshot
Bibliography on paging and related topics
inferred← citeshttps://doi.org/10.1145/800009.808053openalex-snapshot
On reference string generation processes
inferred← citeshttps://doi.org/10.1145/800181.810312openalex-snapshot
A measure for program locality in demand paging
inferred← citeshttps://doi.org/10.1145/800191.805612openalex-snapshot
A Modified Locality Matrix Model (MLMM) - dynamic clustering in a demand paging environment
inferred← citeshttps://doi.org/10.1145/800213.806539openalex-snapshot
A study of program locality and lifetime functions
inferred← citeshttps://doi.org/10.1145/957195.808053openalex-snapshot
On reference string generation processes
inferred← citeshttps://doi.org/10.1147/rd.172.0086openalex-snapshot
Empirically Derived Micromodels for Sequences of Page Exceptions
inferred← citeshttps://doi.org/10.1147/rd.184.0310openalex-snapshot
Optimal Task Switching Policy for a Multilevel Storage System
inferred← citeshttps://doi.org/10.1147/rd.185.0423openalex-snapshot
Analysis of Exception Data in a Staging Hierarchy
inferred← citeshttps://doi.org/10.1147/rd.205.0505openalex-snapshot
Derivation of Miss Ratios for Merged Access Streams
inferred← citeshttps://doi.org/10.18130/v37n35openalex-snapshot
Access Ordering and Effective Memory Bandwidth
inferred← citeshttps://doi.org/10.31274/rtd-180813-6020openalex-snapshot
Design and evaluation of a reference string sampling method
inferred← citeshttps://doi.org/10.5555/314464.314575openalex-snapshot
Optimal prediction for prefetching in the worst case
inferred← citeshttps://doi.org/10.7282/t3v40zs4openalex-snapshot
Modeling and Managing Program References in a Memory Hierarchy
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.