High performance data processing of distributed database and multi-core processor based on particle swarm optimization
Bibliographic record
Abstract
As a product of the combination of computer network technology and database technology, distributed database system has the characteristics of independence and transparency, centralized node combination, replication transparency and easy expansion. However, due to its complex access structure, distributed database system naturally has a high demand for query optimization. This paper proposes a high-performance data processing method between distributed database and multi-core processors based on PSO (Particle Swarm Optimization) to solve the task scheduling problem between multi-core processors. Inertia weight is introduced, which is added to the speed of particle flight to adjust the global and local search ability of stationary particles. The research results show that this method reduces the error rate of database query, and the overall performance of database query method is better. The improved PSO algorithm improves the searching ability of particles by dynamically adjusting the inertia weight. Therefore, the improved PSO is a high-performance algorithm to solve the real-time task scheduling problem of multi-core processors.
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 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.000 | 0.000 |
| 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.004 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".