Computation offloading leveraging computing resources from edge cloud and mobile peers
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we study the joint computation offloading and resource allocation problem exploiting computing resources from both mobile edge cloud and mobile peers. Our design aims to optimize the computation load assignments to local processors in the mobile users, mobile peers and the edge cloud jointly with the resource allocation to achieve the minimum weighted energy consumption subject to practical constraints on the bandwidth and computing resources and allowable latency. To tackle this non-convex optimization problem, we employ the successive convex approximation (SCA) method where we transform the underlying problem and iteratively solve a sequence of approximated convex problems. Moreover, the geometric programming (GP) method is applied to find the optimal solution of the approximated problem. The proposed SCA-based approach employs the arithmetic-geometric mean (AGM) approximation and the proposed algorithm is proved to converge to a local optimal solution. Finally, numerical studies confirm that the proposed scheme achieves energy saving gains about 60% and 10% in comparison with the local computation strategy and cloud offloading strategy under the strict required latency of 0.25s, respectively.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it