MétaCan
Menu
Back to cohort
Record W2331692740 · doi:10.2514/6.2016-1713

Novel Blind Load Balancing Scheduling Algorithms for Distributed Tracking Networks

2016· article· en· W2331692740 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

VenueAIAA Infotech @ Aerospace · 2016
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsLockheed Martin (Canada)
Fundersnot available
KeywordsComputer scienceScheduling (production processes)Distributed computingLoad balancing (electrical power)Processor schedulingParallel computingAlgorithmComputer networkMathematical optimizationMathematics

Abstract

fetched live from OpenAlex

A novel algorithm is presented for quickly balancing responsibilities across a distributed tracking network that requires no explicit coordination between network members. Previous load balancing methods reliably achieved an equilibrium state; however, in times of large disparities (initialization) or discontinuities (loss of a participant), previous methods may require a significant time to reach the balanced state, perhaps several minutes, and experience significant overshoot before achieving a stable and balanced configuration. The improved algorithm offers substantial improvement in convergence time to equilibrium and eliminates the interim overshoot behavior of some previous algorithms.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.817
Threshold uncertainty score1.000

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.0010.001
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.026
GPT teacher head0.261
Teacher spread0.235 · 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