MétaCan
Menu
Back to cohort
Record W2166963505 · doi:10.1109/icecs.2009.5410772

Estimation of energy performance in computing platforms

2009· article· en· W2166963505 on OpenAlexaff
Houman Zarrabi, A.J. Al-Khalili, Yvon Savaria

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsPolytechnique MontréalConcordia University
Fundersnot available
KeywordsComputer scienceEnergy (signal processing)AccelerationSpeedupKey (lock)Bounded functionPerformance predictionVery-large-scale integrationPower (physics)Efficient energy useComputer engineeringReal-time computingParallel computingSimulationEmbedded systemEngineering

Abstract

fetched live from OpenAlex

System-level estimation of speed and energy performance is a key step in design space exploration of low-energy and high-performance VLSI systems. While low-level simulation-based analysis can be too time-consuming to obtain performance elements, system-level models that can quickly and accurately estimate these elements are very valuable. In this work, models for energy performance estimation of computing platforms are proposed. The proposed energy performance models are inspired by Amdahl's law. The models consider platform models based on the support of power gating. Analytical results show that the upper-bound of energy performance, according to the application profile is the ¿resolute¿ (that cannot be enhanced) segment of the (embedded) software application. This is a similar concern to the one seen for ¿net acceleration¿ (the speed performance) being bounded by the ¿sequential¿ segment, according to Amdahl's law. Experimental results demonstrate that large improvements in energy performance may be obtained using power gating for both data and control dominated classes of applications (2 and 12 folds respectively). The results also demonstrate an average error of 22% between the proposed system-level models and true experimental results for three classes of applications.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.611
Threshold uncertainty score0.198

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.245
Teacher spread0.234 · 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

Citations3
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicParallel Computing and Optimization TechniquesFrench-language works237,207