Research on Constructing Task Scheduling and Processing Models for Complex Data Sets Using Multi-Objective Optimization Algorithm
Bibliographic record
Abstract
In the process of increasing the service capacity of digital infrastructure, the complex data generated by data terminals grows rapidly, which puts forward higher requirements for complex data task scheduling preprocessing.In this paper, based on particle swarm algorithm and improved artificial fish swarm algorithm, a hybrid particle swarm multi-objective optimization scheduling algorithm applicable to task scheduling and processing of complex data sets is designed.Then we design a reasonable expression method for the particle position and adaptation value algorithm in the multiobjective optimization algorithm, and put forward the pre-search strategy of the particle swarm algorithm to improve the search performance of the particles in the algorithm.Finally, the algorithm is equipped to construct a task scheduling and processing model for complex data sets.The results show that the hybrid particle swarm optimization algorithm established in this paper outperforms the comparison model in terms of load balancing and processing time, and is able to keep the system CPU utilization between 0.350-0.491 in the simulation experimental environment.It is also found that the application of the task scheduling and processing model in this paper can increase the power of photovoltaic and wind power generation in the grid system and reduce the operating cost of the grid system.This study provides an effective reference method for the processing of data and task scheduling in various types of complex systems, and brings new ideas and directions for research in related fields.
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.005 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".