Towards a Better Lifetime for Non-volatile Caches in Chip Multiprocessors
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
To address the limitations imposed by the conventional SRAM cache, the emerging Non-Volatile Memory (NVM) technologies are widely used nowadays as they provide among other things high density and low leakage. However, the weak endurance of these memory technologies limits their use as a replacement of SRAM. Further, the large intra-set write variation introduced by the application and the existing cache management policies significantly reduces the lifetime of the NVM caches. This paper proposes a technique to reduce intra-set write variation to increase the effective lifetime of the NVM caches. This is achieved by partitioning the cache into equal size windows and using different windows during the execution in order to distribute the writes evenly across the set. Full system simulation results show that our policy reduces the write variation and improves the cache lifetime by 2.1 times and 1.8 times for a single and dual core system, respectively compared to an existing policy.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it