MétaCan
Menu
Back to cohort
Record W4231539454 · doi:10.1109/mascots.2005.33

Impact of Laxity on Scheduling with Advance Reservations in Grids

2005· article· en· W4231539454 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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed and Parallel Computing Systems
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceReservationScheduling (production processes)ScalabilityDistributed computingDynamic priority schedulingGridFair-share schedulingReal-time computingComputer networkEngineeringQuality of serviceOperations managementOperating systemMathematics

Abstract

fetched live from OpenAlex

Advance reservations (ARs) were introduced for application level dynamic scheduling of resources in a grid infrastructure. Previous research shows that ARs can meet their objectives but at a significant performance cost. We argue that laxity in the reservation window of an AR can help improve the performance of AR scheduling. Scheduling ARs with laxities is an NP-hard problem and in this paper we briefly discuss our scalable algorithm for AR scheduling. Based on simulation, the paper investigates in detail the effect laxity on the system performance.

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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.319
Threshold uncertainty score0.210

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.001
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.020
GPT teacher head0.297
Teacher spread0.277 · 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