On the public citation graph

Penalty- and Locality-aware Memory Allocation in Redis Using Enhanced AET

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.1007/s10766-015-0384-3openalex-snapshot
Rochester Elastic Cache Utility (RECU): Unequal Cache Sharing is Good Economics
inferredcites →https://doi.org/10.1109/69.790804openalex-snapshot
Proxy cache algorithms: design, implementation, and performance
inferredcites →https://doi.org/10.1109/focs.2013.17openalex-snapshot
How to Approximate a Set without Knowing Its Size in Advance
inferredcites →https://doi.org/10.1109/icpp.2015.62openalex-snapshot
A Penalty Aware Memory Allocation Scheme for Key-Value Cache
inferredcites →https://doi.org/10.1109/icpp.2015.84openalex-snapshot
Optimal Cache Partition-Sharing
inferredcites →https://doi.org/10.1109/ieeestd.2019.8766229openalex-snapshot
IEEE Standard for Floating-Point Arithmetic
inferredcites →https://doi.org/10.1109/ipdps.2012.117openalex-snapshot
PARDA: A Fast Parallel Reuse Distance Analysis Algorithm
inferredcites →https://doi.org/10.1109/pact.2005.32openalex-snapshot
Multiple page size modeling and optimization
inferredcites →https://doi.org/10.1109/tc.2016.2618920openalex-snapshot
Optimizing Locality-Aware Memory Management of Key-Value Caches
inferredcites →https://doi.org/10.1109/tnet.2011.2173351openalex-snapshot
Fast Dynamic Multiple-Set Membership Testing Using Combinatorial Bloom Filters
inferredcites →https://doi.org/10.1145/1024393.1024415openalex-snapshot
Dynamic tracking of page miss ratio curve for memory management
inferredcites →https://doi.org/10.1145/1037949.1024415openalex-snapshot
Dynamic tracking of page miss ratio curve for memory management
inferredcites →https://doi.org/10.1145/107972.107995openalex-snapshot
Implementing stack simulation for highly-associative memories
inferredcites →https://doi.org/10.1145/1519065.1519076openalex-snapshot
Towards practical page coloring-based multicore cache management
inferredcites →https://doi.org/10.1145/1807060.1807064openalex-snapshot
SOPA
inferredcites →https://doi.org/10.1145/2254756.2254766openalex-snapshot
Workload analysis of a large-scale key-value store
inferredcites →https://doi.org/10.1145/2318857.2254766openalex-snapshot
Workload analysis of a large-scale key-value store
inferredcites →https://doi.org/10.1145/2523616.2527081openalex-snapshot
Dynamic performance profiling of cloud caches
inferredcites →https://doi.org/10.1145/2741948.2741956openalex-snapshot
GD-Wheel
inferredcites →https://doi.org/10.1145/2964791.2901451openalex-snapshot
Noisy Bloom Filters for Multi-Set Membership Testing
inferredcites →https://doi.org/10.1145/3143361.3143368openalex-snapshot
Footprint Descriptors
inferredcites →https://doi.org/10.1145/3185751openalex-snapshot
Fast Miss Ratio Curve Modeling for Storage Cache
inferredcites →https://doi.org/10.1145/3265723.3265736openalex-snapshot
PACE
inferredcites →https://doi.org/10.1145/3299706.3210571openalex-snapshot
mPart: miss-ratio curve guided partitioning in key-value stores
inferredcites →https://doi.org/10.1145/3387514.3405883openalex-snapshot
Caching with Delayed Hits
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1145/377792.377797openalex-snapshot
Analytical cache models with applications to cache partitioning
inferredcites →https://doi.org/10.1147/sj.92.0078openalex-snapshot
Evaluation techniques for storage hierarchies
inferredcites →https://doi.org/10.5555/2685048.2685075openalex-snapshot
Characterizing storage workloads with counter stacks
inferredcites →https://doi.org/10.5555/2750482.2750490openalex-snapshot
Efficient MRC construction with SHARDS
inferredcites →https://doi.org/10.5555/3291168.3291183openalex-snapshot
RobinHood: tail latency-aware caching—dynamically reallocating from cache-rich to cache-poor

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-981-19-8445-7_22openalex-snapshot
A Comparative Analysis of Security Features and Concerns in NoSQL Databases
inferred← citeshttps://doi.org/10.1007/s13042-024-02160-0openalex-snapshot
Redis-based full-text search extensions for relational databases
inferred← citeshttps://doi.org/10.1109/acsos-c66519.2025.00022openalex-snapshot
Render Cost Driven Caching for Object-Based Media
inferred← citeshttps://doi.org/10.1109/hoticn53262.2021.9680837openalex-snapshot
NCA: Accelerating Network Caching with eXpress Data Path
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys53884.2021.00342openalex-snapshot
Survey of Performance Comparison Based on Non Relational Database
inferred← citeshttps://doi.org/10.1109/tc.2025.3590811openalex-snapshot
LAShards: Low-Overhead and Self-Adaptive MRC Construction for Non-Stack Algorithms
inferred← citeshttps://doi.org/10.1109/tcc.2023.3300889openalex-snapshot
Multi-Tenant In-Memory Key-Value Cache Partitioning Using Efficient Random Sampling-Based LRU Model
inferred← citeshttps://doi.org/10.1109/trustcom60117.2023.00135openalex-snapshot
Towards Survivable In-Memory Stores with Parity Coded NVRAM
inferred← citeshttps://doi.org/10.1145/3494538openalex-snapshot
CASHT: Contention Analysis in Shared Hierarchies with Thefts
inferred← citeshttps://doi.org/10.1145/3631882.3631883openalex-snapshot
An Empirical Analysis on Memcached's Replacement Policies
inferred← citeshttps://doi.org/10.18502/espoch.v4i1.15813openalex-snapshot
NoSQL Database Benchmarking: Key/value in an Application-building Environment
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.