A Task Scheduler for Mobile Edge Computing Using Priority-based Reinforcement Learning
Bibliographic record
Abstract
Edge computing offers cloud-like services closer to users and IoT devices, providing high speed and accessibility for network users. Edge computing, often called Mobile Edge Computing (MEC), is a distributed paradigm that utilizes heterogeneous computational and storage resources with well-provisioned capabilities rather than relying on the ample resources of the cloud. In addition, edge users usually refer to portable and mobile devices that connect to and disconnect from the network at will. Therefore, scheduling tasks at the appropriate time and allocating the right resources can be modeled as a multi-objective optimization problem in MEC. Moreover, each task has specific requirements, further adding to the complexity of the optimization problem. In this study, we formulate the scheduling problem as a Markov Decision Process (MDP) to schedule the tasks. The learning time of the task scheduler is minimized when it faces new users and edge servers. Subsequently, we employ the Q-learning (QL) algorithm from the Reinforcement Learning (RL) paradigm to address the optimization problem and effectively adapt the proposed scheduler to the dynamic nature of MEC. Accordingly, we designed the valid state space, action space, and reward function with appropriate conditions and proper rewards for the proposed QL-based technique. We conducted comprehensive experiments to validate the results of the proposed solution, taking into account the inherent randomness of the QL-based technique. The experimental results demonstrate that the proposed technique achieves the lowest learning time compared to Deep learning-based and Deep RL-based approaches. Furthermore, on average, the proposed technique obtains a 72% faster runtime compared to previous works, using 58% fewer computation cycles and 50% less memory. These improvements make the proposed approach an efficient and lightweight task scheduler for MEC.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| 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.003 | 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".