MétaCan
Menu
Back to cohort
Record W2970058891 · doi:10.1109/tpds.2019.2937029

Energy and Task-Aware Partitioning on Single-ISA Clustered Heterogeneous Processors

2019· article· en· W2970058891 on OpenAlexaff
Ashraf Suyyagh, Željko Žilić

Bibliographic record

VenueIEEE Transactions on Parallel and Distributed Systems · 2019
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer scienceFrequency scalingEnergy consumptionScheduling (production processes)Embedded systemCacheEfficient energy useExploitParallel computingSoftwareSymmetric multiprocessor systemDistributed computingMulti-core processorReduction (mathematics)Operating system

Abstract

fetched live from OpenAlex

Heterogeneous multi-core processing is increasingly adopted in embedded systems. Heterogeneous platforms can provide energy consumption reduction by employing longstanding techniques like Dynamic Voltage and Frequency Scaling (DVFS) and Dynamic Power Management (DPM). An effective energy-management strategy simultaneously exploits hardware-and software-level energy-reduction techniques. Energy-efficient partitioning is one software-level method where task allocation to heterogeneous clusters directly impacts the total system energy. In this paper, we couple the problem of energy-efficient partitioning on single-ISA heterogeneous platforms with task-aware scheduling. Tasks differ in their instruction mix, cache, memory and I/O access, execution path, and active processing and SoC circuitry. This affects their power demand. We make further use of underlying hardware frequency scaling to reduce the system energy. We propose four variants of our Task and Cluster Heterogeneity Aware Partitioning (TCHAP) targeting ARM big.LITTLE platforms, and show that our algorithms achieve up to 30 percent energy-reduction on average compared to a state-of-the-art scheme.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
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.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.016
GPT teacher head0.223
Teacher spread0.207 · 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 designSimulation or modeling
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

Citations19
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Parallel and Distributed SystemsSame topicParallel Computing and Optimization TechniquesFrench-language works237,207