MétaCan
Menu
Back to cohort
Record W2482444401 · doi:10.1109/ipdpsw.2016.183

Assessing Multi-task Placement Algorithms in RCUs

2016· article· en· W2482444401 on OpenAlexaff
Anita Tino, Kaamran Raahemifar

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceWorkloadTask (project management)Efficient energy useParallel computingMulti-core processorComputer architecturePersonalizationEmbedded systemPerformance improvementSupercomputerAlgorithmOperating systemEngineering

Abstract

fetched live from OpenAlex

In response to the current requirements of energy efficiency and high performance in computing systems, architects have turned towards customization. General purpose computing however remains a challenge as processors must adhere to a variety of applications, on-chip resources, and increased performance without solely relying on transistor scaling and additional cache levels. For this reason, the concept of Reconfigurable Computing Unit (RCU) processors have been proposed which redesign the conventional processor on the microarchitectural and architectural level. RCUs are extended in this work to support a multi-task workload using OmpSs, where task and instruction placement algorithms are thoroughly assessed for effects of performance and energy efficiency. Experimental results demonstrate that a single RCU processor with a double engine configuration is able to exceed single-core performance on average by 1.48x and achieve/exceed dual-core performance. The various inter-and intra-task placement algorithms tested also display up to 16.7% and 23% fluctuation in performance and energy efficiency, respectively, depending on the method and RCU engine combination employed.

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.002
metaresearch head score (Gemma)0.007
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: Empirical
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.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.040
GPT teacher head0.319
Teacher spread0.279 · 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

Citations2
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicParallel Computing and Optimization TechniquesFrench-language works237,207