Performance Optimization of Serverless Computing for Latency-Guaranteed and Energy-Efficient Task Offloading in Energy-Harvesting Industrial IoT
Bibliographic record
Abstract
Serverless architecture enables various intelligent applications to be run without managing infrastructure. In this architecture, the computing cost is generally proportional to the number of requested stateless functions and this number can affect the task completion time and, thus, it is prominent to decide an appropriate number of requested stateless functions. In this article, we propose a latency-guaranteed and energy-efficient task offloading (LETO) system where an Internet of Things (IoT) device decides the number of stateless functions requested to the cloud by considering the deadline on the task completion time and its energy level. To minimize the computing cost while guaranteeing sufficiently short task completion time and low energy outage probability, we formulate a constrained Markov decision process (CMDP) problem and convert the CMDP problem into an equivalent linear programming (LP) model. By solving the LP model, the optimal policy on the number of requested stateless functions can be achieved. Evaluation results illustrate that LETO can cut down the operating expenditure (OPEX) by up to 59% compared to a latency-guaranteed offloading scheme while keeping the task completion time and the energy outage probability below desirable levels.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 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.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".