KEIDS: Kubernetes-Based Energy and Interference Driven Scheduler for Industrial IoT in Edge-Cloud Ecosystem
Bibliographic record
Abstract
With the rapid explosion of Industrial Internet of Things (IIoT), the need for real-time data processing with enhanced flexibility and scalability has increased manifold. However, the newly evolved containerization technology offers lucrative advantages in comparison to the conventional virtual machines. However, management of these light-weight containers is a tedious task, but Google Kubernetes offers a consolidated container management and scheduling for successful execution of various lightweight containers. Nevertheless, the existing Kubernetes solutions fall short in efficiently handling the “interference” and “energy minimization” challenges in IIoT set-up. Hence, in this article, we present a competent controller, named Kubernetes-based energy and interference driven scheduler (KEIDS), for container management on edge-cloud nodes taking into account the emission of carbon footprints, interference, and energy consumption. The problem of task scheduling has been formulated using integer linear programming based on multiobjective optimization problem. In detail, KEIDS minimizes the energy utilization of edge-cloud nodes in IIoT for optimal green energy utilization. Henceforth, the applications are scheduled on the available nodes in less time with minimum interference from other applications, which in turn guarantees an optimal performance to the end-users. An extensive evaluation of the proposed KEIDS scheduler in comparison to the existing state-of-the-art schemes indicates its superior performance on real-time data acquired from Google compute cluster.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 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.000 | 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".