MétaCan
Menu
Back to cohort
Record W2150005434 · doi:10.1109/simsym.2002.1000084

Controlling buffer usage in critical channel traversing

2003· article· en· W2150005434 on OpenAlexaff
Rob Simmonds, Cameron Kiddle, Kachung Kevin Wong, Brian Unger

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicSimulation Techniques and Applications
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceTraverseAsynchronous communicationDiscrete event simulationAlgorithmChannel (broadcasting)Distributed computingFlow control (data)Parallel computingTheoretical computer scienceComputer engineeringComputer networkSimulation

Abstract

fetched live from OpenAlex

This paper addresses the problem of excessive memory usage in simulators using asynchronous conservative parallel discrete event simulation algorithms. The characteristics of the modeled system that promote this problem are examined. Existing algorithms that attempt to solve this problem are discussed and new flow control algorithms introduced. Results of simulation experiments using both existing and new algorithms are presented. The results show that some existing algorithms fail to achieve their goal. They also show that all of the existing algorithms are sensitive to parameter settings. The new algorithms are shown to be effective and less sensitive to parameter settings.

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.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.938
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.002
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.0010.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.223
GPT teacher head0.477
Teacher spread0.254 · 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.

Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Citations7
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicSimulation Techniques and ApplicationsFrench-language works237,207