MétaCan
Menu
Back to cohort
Record W1139117140

Static task scheduling for configurable multiprocessors

2010· article· en· W1139117140 on OpenAlexaff
Voicu Groza, Miodrag Bolić, Michael Montcalm, Daniel Shapiro

Bibliographic record

VenueuO Research (University of Ottawa) · 2010
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceSpeedupParallel computingMultiprocessingScheduling (production processes)CompilerMultiprocessor schedulingDynamic priority schedulingProgramming languageRate-monotonic schedulingOperating systemScheduleMathematics
DOInot available

Abstract

fetched live from OpenAlex

Our task scheduling pass implemented in the COINS compiler uses a Binary Linear Programming model for scheduling a program into a multiprocessor system-on-chip where\neach processor can be accelerated with instruction set extensions. We compare our work to state of the art approaches\nand estimate an average speedup of 4.01 in application execution time compared to a sequential approach. We estimate\non average a 1.43 times speedup over the use of multiprocessor scheduling without instruction set extensions.

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.001
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.922
Threshold uncertainty score0.349

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.044
GPT teacher head0.320
Teacher spread0.275 · 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

Citations2
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueuO Research (University of Ottawa)Same topicParallel Computing and Optimization TechniquesFrench-language works237,207