Joint Offloading Scheduling and Resource Allocation in Vehicular Edge Computing: A Two Layer Solution
Bibliographic record
Abstract
Vehicular Edge Computing (VEC) is a promising paradigm for autonomous driving. It can reduce delay and energy consumption of tasks. The problem of joint task offloading scheduling and resource allocation in VEC is a challenge issue. In this paper, we investigate the problem of joint task offloading, task scheduling, and resource allocation in VEC, and the fast changing channel between a vehicle and an edge server. A target problem of joint considering task offloading scheduling, resource allocation and time-varying channel in VEC is formulated. The goal is to minimize the delay and energy consumption of tasks to guarantee the Quality of Service (QoS) of VEC. Constraints on the completion time, the energy consumption, and the computing capability are considered for each task. The resulting mixed integer optimization problem is decomposed into a two-layer optimization problem. In the upper layer, we use a Deep Q-Network (DQN) to solve the task offloading scheduling problem. In the lower level, the CPU frequency allocation is determined using the Gradient Descent (GD) method. Numerical results illustrate that the proposed algorithm can minimize the delay and energy consumption of VEC for different network parameter 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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| 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".