On the public citation graph

Analysis of the Optimal, Look-Ahead Demand Paging Algorithms

0 signed · 35 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/tec.1962.5219356openalex-snapshot
One-Level Storage System
inferredcites →https://doi.org/10.1145/321623.321632openalex-snapshot
Principles of Optimal Page Replacement
inferredcites →https://doi.org/10.1145/321796.321800openalex-snapshot
Some Distribution-Free Aspects of Paging Algorithm Performance
inferredcites →https://doi.org/10.1145/355611.362545openalex-snapshot
A note on sub-expression ordering in the execution of arithmetic expressions
inferredcites →https://doi.org/10.1145/361268.361281openalex-snapshot
Properties of the working-set model
inferredcites →https://doi.org/10.1145/361532.361554openalex-snapshot
A model of memory contention in a paging machine
inferredcites →https://doi.org/10.1145/363095.363141openalex-snapshot
The working set model for program behavior
inferredcites →https://doi.org/10.1147/rd.172.0086openalex-snapshot
Empirically Derived Micromodels for Sequences of Page Exceptions
inferredcites →https://doi.org/10.1147/rd.181.0002openalex-snapshot
On-line Measurement of Paging Behavior by the Multivalued MIN Algorithm
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.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/spe.4380100705openalex-snapshot
Multiprogramming and memory contention
inferred← citeshttps://doi.org/10.1007/978-3-319-74947-1_3openalex-snapshot
Markov Analysis of Optimum Caching as an Equivalent Alternative to Belady’s Algorithm Without Look-Ahead
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90034-0openalex-snapshot
Minimization of demand paging for the LRU stack model of program behavior
inferred← citeshttps://doi.org/10.1016/0166-5316(81)90004-3openalex-snapshot
Optimization of I/O systems by cache disks and file migration: A summary
inferred← citeshttps://doi.org/10.1016/0166-5316(95)00028-3openalex-snapshot
Optimal management of dynamic buffer caches
inferred← citeshttps://doi.org/10.1016/b978-0-32-390796-5.00010-3openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1016/b978-0-32-390796-5.00023-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.109583openalex-snapshot
An overview of analysis methods and evaluation results for caching strategies
inferred← citeshttps://doi.org/10.1109/12.204792openalex-snapshot
Managing locality sets: the model and fixed-size buffers
inferred← citeshttps://doi.org/10.1109/tc.1976.1674715openalex-snapshot
A Modified Working Set Paging Algorithm
inferred← citeshttps://doi.org/10.1109/tc.2007.70788openalex-snapshot
RACE: A Robust Adaptive Caching Strategy for Buffer Cache
inferred← citeshttps://doi.org/10.1109/tse.1980.230464openalex-snapshot
Working Sets Past and Present
inferred← citeshttps://doi.org/10.1109/tse.1981.230820openalex-snapshot
Internal Scheduling and Memory Contention
inferred← citeshttps://doi.org/10.1145/1122018.1122046openalex-snapshot
A time invariant working set model for independent reference
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/3017992openalex-snapshot
Some Mathematical Facts About Optimal Cache Replacement
inferred← citeshttps://doi.org/10.1145/358722.358737openalex-snapshot
Long term file migration: development and evaluation of algorithms
inferred← citeshttps://doi.org/10.1145/383734.383737openalex-snapshot
I/O reference behavior of production database workloads and the TPC benchmarks—an analysis at the logical level
inferred← citeshttps://doi.org/10.1145/775323.775329openalex-snapshot
Survey of recent operating systems research, designs and implementations
inferred← citeshttps://doi.org/10.1145/775406.775409openalex-snapshot
Bibliography on paging and related topics
inferred← citeshttps://doi.org/10.1145/800094.803056openalex-snapshot
On the effectiveness of buffered and multiple arm disks
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.6240openalex-snapshot
Dynamic Storage Allocation Using Simon's Model of Information Usage.
inferred← citeshttps://doi.org/10.48550/arxiv.1003.1336openalex-snapshot
FIFO anomaly is unbounded
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.