Research on load balancing techniques based on numerical analysis in distributed systems
Bibliographic record
Abstract
Based on the demand of load balancing in distributed system scenarios, this paper introduces the concept of dynamic priority in the algorithm and designs the dynamic feedback load balancing (DFLB) algorithm for numerical analysis.Through the closed-loop process of collection-feedback-utilization-collection, the overall performance of the system is realized.The Mininet tool and the Floodlight controller are used when building the load balancing system experimental environment to verify the reliability of the algorithm from the response delay, throughput and other indicators.The study shows that the DFLB algorithm reduces the response time of the system by about 20% compared with the static deployment method, and the DFLB algorithm reduces the load variance, saves computational resources, and makes the load of the system more balanced and efficient.The average throughput of the DFLB algorithm is improved by about 10% compared with the PALB algorithm and DALB algorithm, and 6% compared with the PALB algorithm and DALB algorithm, respectively.Starting from 1000 concurrent connections, the DFLB algorithm has a higher access rate.Thus, the algorithm leads to an improvement in the overall performance of the system.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".