Multitiered Worker-Oriented Resource Allocation at the Extreme Edge
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
Fostering Edge Computing (EC) by recycling prolific yet underutilized computational resources of the Internet of Things (IoT) devices, also referred to as Extreme Edge Devices (EEDs), has gained significant momentum lately. Fair resource allocation is a primary concern in such computing paradigms. However, fairness is typically considered from the requester's perspective, whereas fairness for workers (i.e., EEDs) is mostly overlooked. In this context, we propose the Multitiered Worker-Oriented Resource Allocation (MWORA) scheme. In MWORA, the resource allocation problem is formulated as an Integer Linear Program (ILP). MWORA aims to maximize service capacity and minimize the task response delay while enabling fair resource allocation that maintains a specific satisfactory profit for workers. Such a satisfactory level is maintained to prevent the workers from leaving the system and ensure their recurrent subscription to the service. This is done while abiding by the deadline demanded by each requester and without exceeding a certain budget. MWORA also accounts for the fact that EEDs are user-owned devices and are thus subject to a dynamic user access behavior, which can affect the level of computational resources that workers are willing to offer. In particular, MWORA enables multitiered computational resources to be granted by each worker depending on the price of the allocated task. Extensive simulations have shown that MWORA outperforms other baseline resource allocation schemes regarding average response delay, service capacity, worker satisfaction ratio, and fairness.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.005 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.009 | 0.010 |
| Research integrity | 0.000 | 0.001 |
| 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