On metrics for the dynamic load balancing of optimistic simulations
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.
Bibliographic record
Abstract
Focuses on evaluating metrics for use with the dynamic load balancing of optimistic simulations. We present a load balancing algorithm which is token-based and is used in conjunction with clustered time warp (CTW). CTW is a hybrid synchronization protocol, which makes use of a sequential algorithm within clusters of logical processes (LPs) and time warp between the clusters. We define three separate metrics and measure their effectiveness in different simulation environments. One metric measures processor utilization, a second measures the difference in virtual times between the clusters, while a third is a combination of these two metrics. We compare the execution time, memory consumption and throughput obtained in three simulation environments by each of these metrics and to the results obtained without load balancing. Our categories of simulation are VLSI simulations, characterized by a large number of LPs and a low computational granularity; distributed network simulations, in which the workload varies spatially over the execution of the simulation; and a pipeline simulation, characterized by a single direction of message flow. The experiments revealed a significant improvement in the simulation times in the first two categories of simulations when we employed the processor utilization and the combination metrics. For example, improvements of up to 70% were obtained for VLSI simulations. None of the metrics proved to be effective for the pipeline simulation.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.008 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it