MétaCan
Menu
Back to cohort
Record W2150959205 · doi:10.1109/igcc.2013.6604502

Application Specific Low Leakage data Cache for embedded processors

2013· article· en· W2150959205 on OpenAlex
Mostafa Farahani, Fatemeh Eslami, Amirali Baniasadi

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsCacheComputer scienceLeakage (economics)CPU cacheGranularityParallel computingEmbedded systemCache algorithmsLeakage powerOperating systemPower (physics)Power consumption

Abstract

fetched live from OpenAlex

Previous studies have suggested using drowsy caches to reduce leakage power in caches. Such studies often move an entire cache line in and out of the drowsy mode to reduce leakage power while maintaining performance. In this work we extend previous work and introduce Application Specific Low Leakage Cache (ASL) as an alternative power-aware data cache for embedded processors. ASL builds on the observation that often only one or two words of a cache line are accessed during long periods. Accordingly, we investigate a word-size granularity approach to drowsy caches. We introduce two ASL variations, i.e., B-ASL and P-ASL. In B-ASL we move all words in a cache line into the drowsy (low leakage) mode and wakeup only the words accessed. In P-ASL we make sure recently accessed words stay in the non-drowsy (high leakage) mode to maintain performance. We show that ASL can reduce leakage power in caches by 88% while paying an average performance cost of 0.7% compared to drowsy cache..

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.970
Threshold uncertainty score0.304

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.037
GPT teacher head0.285
Teacher spread0.248 · 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