On the public citation graph

Managing locality sets: the model and fixed-size buffers

0 signed · 42 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.1016/0196-6774(85)90037-9openalex-snapshot
An analysis of optimum caching
inferredcites →https://doi.org/10.1016/0306-4573(76)90015-7openalex-snapshot
An introduction to database systems
inferredcites →https://doi.org/10.1016/0377-2217(85)90047-5openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving
inferredcites →https://doi.org/10.1016/s0736-5853(86)80081-8openalex-snapshot
Heuristics: Intelligent Search Strategies for Computer Problem Solving
inferredcites →https://doi.org/10.1109/tc.1976.1674680openalex-snapshot
Aspects of a Dynamically Adaptive Operating System
inferredcites →https://doi.org/10.1109/tse.1980.230464openalex-snapshot
Working Sets Past and Present
inferredcites →https://doi.org/10.1137/0205052openalex-snapshot
Analysis of the Optimal, Look-Ahead Demand Paging Algorithms
inferredcites →https://doi.org/10.1145/1031382.809311openalex-snapshot
A measure of program locality and its application
inferredcites →https://doi.org/10.1145/1479992.1480077openalex-snapshot
The page fault frequency replacement algorithm
inferredcites →https://doi.org/10.1145/2363.2367openalex-snapshot
Optimal prepaging and font caching
inferredcites →https://doi.org/10.1145/3148.3325openalex-snapshot
Use of graph-theoretic models for optimal relational database accesses to perform join
inferredcites →https://doi.org/10.1145/317499.317551openalex-snapshot
Measurement and analysis of locality phases in file referencing behaviour
inferredcites →https://doi.org/10.1145/323627.323632openalex-snapshot
A caching file system for a programmer's workstation
inferredcites →https://doi.org/10.1145/323647.323632openalex-snapshot
A caching file system for a programmer's workstation
inferredcites →https://doi.org/10.1145/348.318586openalex-snapshot
The Grid File
inferredcites →https://doi.org/10.1145/35037.35059openalex-snapshot
Scale and performance in a distributed file system
inferredcites →https://doi.org/10.1145/356789.356797openalex-snapshot
Data Structures for Range Searching
inferredcites →https://doi.org/10.1145/357980.357997openalex-snapshot
The working set model for program behavior
inferredcites →https://doi.org/10.1145/360051.360227openalex-snapshot
Characteristics of program localities
inferredcites →https://doi.org/10.1145/360051.360231openalex-snapshot
MIN—an optimal variable-space page replacement algorithm
inferredcites →https://doi.org/10.1145/361179.361195openalex-snapshot
Improving locality by critical working sets
inferredcites →https://doi.org/10.1145/361268.361281openalex-snapshot
Properties of the working-set model
inferredcites →https://doi.org/10.1145/363095.363141openalex-snapshot
The working set model for program behavior
inferredcites →https://doi.org/10.1145/582250.582278openalex-snapshot
A new way to compute the product and join of relations
inferredcites →https://doi.org/10.1145/61733.61737openalex-snapshot
Dynamic multipaging in even less space
inferredcites →https://doi.org/10.1145/800264.809311openalex-snapshot
A measure of program locality and its application
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.103.0168openalex-snapshot
Program restructuring for virtual memory
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
inferredcites →https://doi.org/10.1201/9781420003345.ch1openalex-snapshot
Introduction to Database Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/0166-5316(95)00028-3openalex-snapshot
Optimal management of dynamic buffer caches
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:1008135917341openalex-snapshot
Power and Speed-Efficient Code Transformation of Video Compression Algorithms for RISC Processors
inferred← citeshttps://doi.org/10.1109/69.506717openalex-snapshot
An optimal resource scheduler for continuous display of structured video objects
inferred← citeshttps://doi.org/10.1109/82.625008openalex-snapshot
Minimization of memory access overhead for multidimensional DSP applications via multilevel partitioning and scheduling
inferred← citeshttps://doi.org/10.1109/isie.1994.333088openalex-snapshot
A concurrent hardware software management scheme for memory hierarchies
inferred← citeshttps://doi.org/10.1109/mmsp.1998.738953openalex-snapshot
Power and speed-efficient code transformation of multimedia algorithms for RISC processors
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/263272.263278openalex-snapshot
Formalized methodology for data reuse exploration in hierarchical memory mappings
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.