An effective technique to schedule priority aware tasks to offload data on edge and cloud servers
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
Recent advancements in the Internet of Things (IoT) have enhanced the quality of life globally. Billions of devices are brought under the ambit of IoT to make them smarter. IoT-based applications are generating voluminous data and managing this widespread amount of data in real-time through Cloud Technology, which offers high computational and storage facilities. However, sending all data to the cloud can bring serious concerns for applications, which are critical and require instant action without any delay. Edge computing has recently emerged as an effective technology to handle the instant processing of tasks of IoT-based applications locally. Additionally, an important concern in IoT networks is response to emergency tasks on time to increase the performance of large-scale IoT systems. As such, scheduling of tasks becomes vital, where emergency and non-emergency tasks can be prioritized to offload data to the nearby edge and cloud servers respectively and enhance Quality of Service (QoS). The execution order of tasks and allocating resources for computation to avoid delays are two of the most important factors that must be addressed during task scheduling in Edge Computing. With the aforementioned issues, we design a Priority aware Task Scheduling (PaTS) algorithm for sensor networks to schedule priority aware tasks to offload data on edge and cloud servers. The problem is formulated as a multi-objective function and the efficiency of the proposed algorithm is evaluated using the Bio-inspired NSGA-2 technique. The overall improvement for average queue delay, computation time, and energy obtained for 200 tasks is 17.2%, 7.08% and 11.4%, respectively. The results obtained show significant improvement when compared with the benchmark algorithms demonstrating the effectiveness of the proposed solution. Similarly, comparative results for tasks when increased from 200 to 1000 tasks also shows subsequent improvements.
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.003 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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