Column selection solutions for <i>L</i> 1 data caches implemented using eight‐transistor cells
Bibliographic record
Abstract
Voltage scaling can reduce power dissipation significantly. SRAM cells (which are traditionally implemented by using six‐transistor cells) can limit voltage scaling because of stability concerns. Eight‐transistor (8T) cells were proposed to enhance cell stability under voltage scaling. 8T cells, however, suffer from costly write operations caused by the column selection issue. A proposed technique, Read‐Modify‐Write (RMW), addresses this issue at the expense of extra read operations. The extra cache access affects performance and power dissipation negatively. In this study, the authors show that a large share of the cache accesses in RMW is unnecessary. To address this inefficiency, they propose two micro‐architectural solutions with the aim of reducing the overhead imposed by RMW. The authors first proposed technique, Write Grouping (WG), relies on a buffering mechanism that identifies the redundant and the unnecessary cache accesses imposed by RMW and eliminates them. Their second technique, WG and Read Bypassing (WG + RB), improves the WG's efficiency further at a negligible area cost. Their simulation results show that on average, WG and WG + RB reduce RMW's cache traffic overhead by 15% and 20%, respectively. They show that WG and WG + RB also improve average performance by 30% and 37%, respectively.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| 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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".