Probability-Based Crossover Genetic Algorithm for Task Scheduling in Cloud Computing
Bibliographic record
Abstract
In order to meet the rising demand for cloud services and remain in compliance with Service Level Agreements (SLA), service providers require effective task scheduling solutions capable of adapting to cloud computing’s elastic and dynamic characteristics.In this paper, we propose a novel approach to optimize task scheduling in cloud computing called a ProbabilityBased Crossover Genetic Algorithm (PxGA) with a primary objective of minimizing the tasks execution makespan. PxGA is an improvement on the Genetic Algorithm (GA) achieved by introducing the concept of Virtual Machine (VM) fitness and applying it to implement an effective weighted probabilistic crossover technique. Using the CloudSim simulation toolkit, we conduct our analysis of PxGA and evaluate it against standard and more recent task scheduling algorithms. The results of the simulations show that our proposed task scheduling algorithm is superior to other task scheduling algorithms in terms of the makespan, the VMs energy consumption, and the degree of imbalance (DoI). Moreover, the computational time (CT) for the PxGA decreases when compared against the other evaluated algorithms, except for its base GA.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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 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".