DRUDGE: Dynamic Resource Usage Data Generation for Extreme Edge Devices
Bibliographic record
Abstract
Extreme Edge Computing (EEC) can drastically curtail the delay, reduce network bandwidth consumption, and enhance system performance by providing computing resources closer to the data-generating Internet of Things (IoT) devices. However, the use of Extreme Edge Devices (EEDs) in EEC presents unique challenges imposed by the inherent dynamic user-access behavior, which introduces highly dynamic resource usage. To tackle such challenges, it is crucial to enable accurate resource usage predictions, which in turn requires having reliable datasets. In this paper, we cultivate the Dynamic Resource Usage Data Generation for EEDs (DRUDGE) methodology. DRUDGE generates datasets that capture the resource usage dynamics of EEDs running diverse user-end applications in fine-grained intervals over extended periods. We present an in-depth characterization of resource utilization in EEDs and make the datasets publicly available to the research community. We examine the temporal variation of critical system metrics, such as CPU usage, memory usage, temperature, and network traffic. Furthermore, we apply various statistical tests to gain valuable insights into the data characteristics, including skewness, kurtosis, stationarity, volatility, cointegration, multi-collinearity, Granger causality, and Pearson correlation analysis. These insights inform model selection, feature engineering, and preprocessing techniques, leading to more accurate and reliable forecasts and analyses for EEC systems.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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.001 | 0.001 |
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".