MétaCan
Menu
Back to cohort
Record W2156409740 · doi:10.1109/ccece.1995.526578

A transputer based simulation of colliding pucks

2002· article· en· W2156409740 on OpenAlex
William Bishop, M. Hembruch

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
FieldDecision Sciences
TopicSimulation Techniques and Applications
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsTransputerSpeedupComputer scienceDiscrete event simulationBenchmark (surveying)Parallel computingOverhead (engineering)Event (particle physics)SimulationOperating systemPhysics

Abstract

fetched live from OpenAlex

The goal of a colliding puck simulator is to predict the movements of pucks on a frictionless, 2-dimensional surface bounded by cushions. When implemented as a parallel discrete event simulation, a colliding puck simulator requires designers to address all of the fundamental issues associated with parallel simulation. For this reason, colliding puck simulations may be used to benchmark the performance of parallel discrete event simulators. Our transputer based implementation of a colliding puck simulator uses the time warp approach to parallel discrete event simulation. Through the use of incremental state-saving and lazy cancellation, the overhead associated with checkpointing and rollbacks is minimized. It is this overhead which limits the speedup of the simulation when implemented on a parallel system. Our results indicate that a significant parallel speedup is possible for a sufficiently complex system of pucks.

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 categoriesInsufficient payload (model declined to judge)
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.952
Threshold uncertainty score0.995

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.0060.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.323
GPT teacher head0.442
Teacher spread0.119 · 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

Citations5
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicSimulation Techniques and ApplicationsFrench-language works237,207