MétaCan
Menu
Back to cohort
Record W2980350661 · doi:10.1109/lcomm.2019.2948179

Collision-Free Sequential Task Offloading for Mobile Edge Computing

2019· article· en· W2980350661 on OpenAlexafffund
Ahmed A. Al-Habob, Ahmed Ibrahim, Octavia A. Dobre, Ana García Armada

Bibliographic record

VenueIEEE Communications Letters · 2019
Typearticle
Languageen
FieldComputer Science
TopicIoT and Edge/Fog Computing
Canadian institutionsMemorial University of Newfoundland
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceMobile edge computingServerBenchmark (surveying)Edge computingEnhanced Data Rates for GSM EvolutionLatency (audio)HeuristicTask (project management)Optimization problemScheme (mathematics)Mathematical optimizationDistributed computingAlgorithmComputer networkMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

In this letter, a collision-free sequential task offloading scheme to multiple mobile-edge computing servers is proposed. The problem is formulated as a multi-objective optimization of latency and offloading failure probability. An exact solution technique is developed to obtain a benchmark optimal solution for the problem. A more computationally efficient heuristic algorithm is additionally developed, whose sub-optimal solution yields a performance close to optimal. Simulation results illustrate that the proposed offloading scheme can effectively reduce both latency and offloading failure probability.

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 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 categoriesOpen science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.720
Threshold uncertainty score1.000

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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0060.002
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.029
GPT teacher head0.286
Teacher spread0.257 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designNot applicable
Domainnot available
GenreEmpirical

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

Quick stats

Citations24
Published2019
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Communications LettersSame topicIoT and Edge/Fog ComputingFrench-language works237,207