MétaCan
Menu
Back to cohort
Record W7133023002

Tagfilter :a power-aware tag hierarchy for high-level caches

2003· dissertation· W7133023002 on OpenAlexaff
Won-Ho Park

Bibliographic record

VenueTSpace · 2003
Typedissertation
Language
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsBibliographical Society of CanadaUniversity of Toronto
Fundersnot available
KeywordsCacheSpec#LocalityExploitCache algorithmsSearch engine indexingCPU cacheBus sniffingSmart CacheTranslation lookaside buffer
DOInot available

Abstract

fetched live from OpenAlex

This thesis proposes and evaluates Tagfilter, a novel power-aware cache hierarchy, coupled with an alternate cache indexing scheme, as a means for reducing power dissipation in high-level caches by filtering out unnecessary accesses. As high-level caches get larger and increase in associativity, they will inevitably consume sizable amounts of power. Interposed between the L1 and the L2 tag arrays, Tagfilter is a small, cache-like structure that caches a small number of recently accessed L2 tag sets, and filters out unnecessary tag array accesses that would otherwise waste considerable power in the L2 tag array. The Tagfilter exploits the tag-set locality existing in typical L2 access patterns. We also propose an alternate cache indexing scheme, which increases Tagfilter's efficiency (filter rate) by increasing tag-set locality. The Tagfilter results in reduced power because it reduces accesses to the much more power-demanding L2 tag array. Power savings by the Tagfilter are evaluated using the SPEC CPU2000 benchmarks running on SimpleScalar V3.0, a software processor model. The modified Wattch power models are used. On average, the Tagfilter reduces the power dissipation in the L2 tag array by 43% for the writeback L1 data cache and by 85% for the writethrough L1 data 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.

How this classification was reachedexpand

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.455
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.000
Open science0.0020.000
Research integrity0.0010.001
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.046
GPT teacher head0.340
Teacher spread0.295 · 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 teacher head, not a consensus.

Study designNot applicable
Domainnot available
GenreMethods

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

Citations0
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueTSpaceSame topicParallel Computing and Optimization TechniquesFrench-language works237,207