MétaCan
Menu
Back to cohort
Record W1980330344 · doi:10.1109/icecs.2011.6122378

Rules class approach to scheduling algorithms

2011· article· en· W1980330344 on OpenAlex
Martin Dubois, Mounir Boukadoum

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicScheduling and Optimization Algorithms
Canadian institutionsUniversité du Québec à Montréal
Fundersnot available
KeywordsComputer scienceFair-share schedulingScheduling (production processes)Dynamic priority schedulingRate-monotonic schedulingFixed-priority pre-emptive schedulingTwo-level schedulingJob shop schedulingFlow shop schedulingDistributed computingAlgorithmEmbedded systemMathematical optimizationComputer networkMathematics

Abstract

fetched live from OpenAlex

As processors on-chip gain in numbers and complexity, task scheduling has become an important concern in system design, and the related research has produced substantial and diversified knowledge. As a result, the efficient taping and management of this knowledge has become a concern in itself. In particular, it can bring new ways to improve scheduling algorithms. This paper describes a new algorithm class based on association rules mining. It serves to both increase the knowledge about a particular scheduling algorithm and show how to improve its performance. Two examples show how this new methodology can be used to improve makespan and processor use globally by optimizing the scheduling method locally.

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.

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: Methods
Teacher disagreement score0.232
Threshold uncertainty score0.682

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.001

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.034
GPT teacher head0.221
Teacher spread0.188 · 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

Quick stats

Citations1
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicScheduling and Optimization AlgorithmsFrench-language works237,207