Real-Time and Low-Overhead Graph Task Scheduling over Vehicular Computing-Assisted Edge Networks
Bibliographic record
Abstract
Modern vehicular networks encounter a multitude of computation-intensive tasks that have unique processing topologies represented by graph structures. The integration of edge computing and vehicular networks has provided a unique platform for handling these tasks at the network edge. However, the complex structure of these tasks makes their scheduling and execution challenging. This paper proposes a Vehicular Computing-assisted Edge Network (VCEN) architecture, where graph tasks are scheduled over a Vehicle-Edge Collaborative Cloud (VECC) for parallel execution. Our goal is to obtain feasible mappings between task components and computing nodes in the VECC while minimizing task execution latency and energy consumption. We show that achieving this goal requires solving an NP-hard optimization problem with complex constraints related to task structure and VECC topology. We then propose a fast and lightweight approach for graph task scheduling over VECC that comprises two key phases. In the former phase, we introduce a preprocessing algorithm that reduces the graph task's dimensionality by merging important components and cutting redundant edges. In the latter phase, we deploy a cost-reduction-preferred mapping algorithm to obtain feasible mappings between task components and VECC. Through simulations, we demonstrate our superior performance in different network settings.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 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.000 |
| 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".