MétaCan
Menu
Back to cohort
Record W2280700298 · doi:10.5555/2348196.2348205

Conservative synchronization methods for parallel DEVS and Cell-DEVS

2011· article· en· W2280700298 on OpenAlex
Shafagh Jafer, Gabriel Wainer

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 institutionsCarleton University
Fundersnot available
KeywordsDEVSComputer scienceSynchronization (alternating current)DeadlockDiscrete event simulationDistributed computingParallel computingProtocol (science)Event (particle physics)Theoretical computer scienceModeling and simulationComputer networkSimulation

Abstract

fetched live from OpenAlex

synchronization, null message, centralized synchronization. We present three conservative synchronization mechanisms for parallel DEVS and Cell-DEVS. The protocols are based on the classical Chandy-Misra-Bryant null message mechanism with deadlock avoidance. Our protocols provide a novel DEVS-based conservative approach that is deadlockfree, and extracts the lookahead information from the model’s specification. The protocols are integrated into the CD++ simulation toolkit, providing a conservative simulator (named CCD++) for running large-scale DEVS and Cell-DEVS models in parallel and distributed fashion. We provide a comparative study of these protocols by investigating different performance metrics including: total execution time, blocked time, memory consumption, total number of positive and null event, as well as null message ratio, showing how CCD++ provides considerable speedups, and its ability for simulating large DEVS-based models. 1.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.527
Threshold uncertainty score0.698

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
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.324
GPT teacher head0.504
Teacher spread0.180 · 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

Citations8
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicSimulation Techniques and ApplicationsFrench-language works237,207