MétaCan
Menu
Back to cohort
Record W4226223886 · doi:10.1109/tsusc.2022.3165016

Situation-Aware Orchestration of Resource Allocation and Task Scheduling for Collaborative Rendering in IoT Visualization

2022· article· en· W4226223886 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Sustainable Computing · 2022
Typearticle
Languageen
FieldComputer Science
TopicIoT and Edge/Fog Computing
Canadian institutionsWestern University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceDistributed computingScheduling (production processes)Rendering (computer graphics)OrchestrationQuality of serviceVisualizationReal-time computingComputer networkArtificial intelligence

Abstract

fetched live from OpenAlex

Three dimensional rendering enabled IoT visualization provides an immersive operation view across large physical environments by contextually aggregating and visualizing numerous data streams from various systems. The massive resource demand to support real-time and high-quality rendering services can be fulfilled by collaborative rendering among resource-constrained wireless devices. To deliver reliable performance, one main challenge is to achieve reliable and sustainable collaboration in a dynamic IoT system with heterogeneous resource capacity and changing user intent. To overcome such issues, we propose a situation-aware orchestration mechanism of resource allocation and task scheduling. The proposed technique achieves objective-driven exploration of collaboration opportunity among heterogeneous resource by three steps: recognizing dynamic condition of resource and task, including resource reliability and computational demand; understanding the mutual impact of resource condition and task performance in the aspect of energy consumption and latency; precise alignment of resource capacity and task demands via a redundant task scheduling scheme. The proposed task scheduling problem is formulated as an optimization model with the objective of maximizing collaboration utility. A genetic algorithm (GA) with adaptive mating-distance is designed to tackle the NP-hard problem, which improves the optimal solution in simulation by approximately 25% and 30% compared to conventional GA and Greedy algorithm, 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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.839
Threshold uncertainty score0.791

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.019
GPT teacher head0.270
Teacher spread0.251 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it