MétaCan
Menu
Back to cohort
Record W2145548588 · doi:10.1109/hpcs.2006.23

Evaluation of Knapsack-Based Scheduling Using the NPACI JOBLOG

2006· article· en· W2145548588 on OpenAlex

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.
fundA Canadian funder is recorded on the work.
aboutThe title or abstract carries a Canadian signal from the geographic lexicon.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed and Parallel Computing Systems
Canadian institutionsInstitute of Particle PhysicsUniversity of Victoria
FundersNational Science CouncilUniversity of Victoria
KeywordsKnapsack problemComputer scienceGridScheduling (production processes)Software deploymentTask (project management)Continuous knapsack problemGrid computingMathematical optimizationDistributed computingMathematicsAlgorithmOperating systemEngineering

Abstract

fetched live from OpenAlex

GridX1 is a computational grid deployment of off-theshelf components using shared resources at several Canadian research institutions. This work evaluates the applicability of knapsack-based resource scheduling to real grids, such as GridX1, by simulating the execution of a real job trace (the NPACI JOBLOG). The task interarrival time is scaled to demonstrate the benefits of the knapsack strategy when operating under heavy workloads. Measurements are made of the effect of varying the task reallocation period \tau and the task value scaling factor \alpha. The knapsack-based allocation strategies are shown to result in allocations which are consistent with the defined policies.

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.002
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: Empirical · Consensus signal: none
Teacher disagreement score0.804
Threshold uncertainty score0.212

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.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.058
GPT teacher head0.299
Teacher spread0.241 · 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