Cache configuration and data placement are modeled as a multiple-choice knapsack problem, with trace-driven results favoring tiering over replication when failures are rare.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Memory Hierarchy Design for Caching Middleware in the Age of NVM
Cache configuration and data placement are modeled as a multiple-choice knapsack problem, with trace-driven results favoring tiering over replication when failures are rare.