MétaCan
Menu
Back to cohort
Record W2169072909 · doi:10.1109/ccece.2007.133

Fast Power Estimation for Automatic Instruction-Set Selection

2007· article· en· W2169072909 on OpenAlexaff
Peter Hallschmid, David S. Yeager, Resve Saleh

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceInstruction setSelection (genetic algorithm)Set (abstract data type)Function (biology)EnumerationSimple (philosophy)Power (physics)Block (permutation group theory)Probabilistic logicParallel computingArtificial intelligenceProgramming languageMathematics

Abstract

fetched live from OpenAlex

Recent research in the area of application specific instruction-set processors (ASIPs) has focused on the automatic selection of a custom instruction-set based on a high-level description of the application. Automatic instruction-set selection is typically comprised of instruction selection and instruction enumeration. During instruction enumeration, candidate instructions are identified using a simple cost function that minimizes the total number of operations in each basic block of the application while also adhering to the micro-architectural constraints of the ASIP. Existing methods indirectly account for power by using the above mentioned cost function and relying on the assumption that fewer operations will always reduce power. This approach is generally taken because power estimation is time-consuming. In this paper, we directly estimate the power dissipation of a custom instruction by using a simple yet effective probabilistic approach based on probability distributions of the input Hamming distance. Results indicate that our approach can estimate the power dissipation incurred by a custom instruction to within 12% of the value reported by PrimePower.

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.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.933
Threshold uncertainty score0.292

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.000
Open science0.0000.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.012
GPT teacher head0.280
Teacher spread0.268 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicParallel Computing and Optimization TechniquesFrench-language works237,207