Distributed and Parallel Metaheuristic-based Algorithms for Online Virtual Resource Allocation
Bibliographic record
Abstract
In this dissertation, we propose a metaheuristic Genetic Algorithm (GA) adopted in a distributed and parallel implementation, providing a fast resource allocation approach while maintaining a good performance efficiency.In the first place, we study the role of virtual link mapping stage in online virtual network embedding (VNE) problem where virtual node mapping (VNoM) and virtual link mapping (VLiM) are conducted separately.We propose several efficient GA-based algorithms driven by nonlinear fitness functions for VLiM stage.Extensive simulation results reveal that our proposed algorithms are not only significantly faster than many existing VNE algorithms, but also better than those in performance.Although uncoordinated VNoM and VLiM stages can simplified an algorithmic implementation, a lack of coordination between them might result in low embedding outcomes.To fill this gap, in the second part, we propose a new approach that jointly coordinates virtual node and link mappings in a single stage, where the virtual link mapping is based on several efficient path searching methods.Moreover, a novel heuristic conciliation mechanism is presented to handle a possible set of infeasible link mappings.Our proposed algorithms outperform state-of-the-art VNE approaches in all performance metrics we adopted.In the last part of this dissertation, we propose a collaborative edge computing framework empowered by parked vehicles (PVs) to efficiently handle online computational tasks during peak hours.We formulate the online task offloading as a binary integer programming (BIP) problem aimed at minimizing offloading cost while maximizing accumulative rewards of PVs by sharing their idle resources.To solve the problems of time complexity and scalability of BIP, a heuristic algorithm, namely M&M, and a distributed and parallel GA-based algorithm are introduced.They are then compared with several heuristic algorithms to demonstrate their efficiency on different sizes of generic parking lots.
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.001 |
| 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.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".