MétaCan
Menu
Back to cohort
Record W2603574511 · doi:10.1109/vlsid.2017.4

Towards a Better Lifetime for Non-volatile Caches in Chip Multiprocessors

2017· article· en· W2603574511 on OpenAlexfundno aff
Sukarn Agarwal, Hemangee K. Kapoor

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsnot available
FundersMinistère de l'Économie, de la Science et de l'Innovation - Québec
KeywordsComputer scienceCacheStatic random-access memoryParallel computingCPU cacheNon-volatile memoryEmbedded systemMulti-core processorSet (abstract data type)Computer hardware

Abstract

fetched live from OpenAlex

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.001
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.025
GPT teacher head0.294
Teacher spread0.269 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations10
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicParallel Computing and Optimization TechniquesFrench-language works237,207