A Framework for Performing Statistical Testing of Distributed Systems
Bibliographic record
Abstract
A major obstacle facing developers of large-scale distributed applications is deployment of the software under real-world conditions. While the product may hold up under lab conditions, it can fail horribly when faced with actual users using the service over the Internet. Part of the problem lies in the fact that there is very little support for software developers to examine the true behavioral nature of their software at scale. In order to determine this nature, it is important to be able reproduce a large number of different, realistic environmental conditions repeatedly and consistently. Without this ability, it becomes very difficult to argue that the observed behavior is truly representative of the system. Put in a different perspective, while characteristics like average throughput, response delay, and time between failures can be computed based on the lab results, it is unclear whether these measurements do indeed capture the true statistical properties of the system, as opposed to a momentary, rare blip. This work presents a prototype implementation of a framework that allows automated testing, including repeatable experiments (as required by the tenets of the scientific method), sweeping through experiment parameters, and supporting the ability to engage in closed-loop testing. The intention of this prototype effort is to build on top of existing testbed capabilities, such as those provided by Emulab. The results of using this prototype framework to test an industry-held distributed system, and to research collaborative worm propagation mitigation strategies, are shown.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.039 | 0.077 |
| Meta-epidemiology (narrow) | 0.003 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.005 |
| Bibliometrics | 0.005 | 0.002 |
| Science and technology studies | 0.002 | 0.007 |
| Scholarly communication | 0.005 | 0.005 |
| Open science | 0.007 | 0.004 |
| Research integrity | 0.003 | 0.006 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".