MétaCan
Menu
Back to cohort
Record W2614946199 · doi:10.1109/apec.2017.7931114

A robust dynamic voltage scaling scheme for FPGAs with IR drop compensation

2017· article· en· W2614946199 on OpenAlexaff
Shuze Zhao, Ibrahim Ahmed, Armina Khakpour, Vaughn Betz, Olivier Trescases

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicLow-power high-performance VLSI design
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsReconfigurabilityDynamic voltage scalingField-programmable gate arrayVoltagePower network designComputer scienceVoltage dropChipElectronic engineeringEmbedded systemElectrical engineeringEngineering

Abstract

fetched live from OpenAlex

Dynamic Voltage Scaling (DVS) has been shown to yield dramatic power savings in modern FPGAs. Because each user-specific hardware design has unique critical paths, the hardware reconfigurability of FPGAs renders the implementation of DVS much more challenging compared to CPUs. A promising FPGA DVS scheme relies on a two-step, offline self-characterization of the minimum supply voltage of the critical paths versus frequency and temperature. It does not, however, account for the resistive voltage drops in the power distribution network during regular operation. As a result, voltage guard-bands are necessary, reducing the power savings. In this paper, a self-calibration method is demonstrated to directly measure the on-chip voltage using a calibrated Delay-Line ADC (DL-ADC). The temperature dependent resistance between the dc-dc converter feedback point and the on-chip critical path is accurately extracted and used in regular DVS mode to compensate the voltage drop according to the load current. The new DVS scheme is demonstrated on an Altera Cyclone IV 60-nm FPGA with a digitally controlled dc-dc converter.

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.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

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

Opus teacher head0.021
GPT teacher head0.224
Teacher spread0.203 · 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 designBench or experimental
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 topicLow-power high-performance VLSI designFrench-language works237,207