MétaCan
Menu
Back to cohort
Record W2342398110 · doi:10.1109/rtas.2016.7461364

Trading Cores for Memory Bandwidth in Real-Time Systems

2016· article· en· W2342398110 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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicReal-Time Systems Scheduling
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceParallel computingShared memoryMulti-core processorUniform memory accessMemory bandwidthScheduling (production processes)Distributed memoryFlat memory modelBandwidth (computing)Interleaved memorySet (abstract data type)Distributed computingMemory managementSemiconductor memoryComputer hardwareComputer network

Abstract

fetched live from OpenAlex

Federated scheduling has been proposed for parallel tasks. In this scheduling scheme, each parallel task is a assigned a private set of cores whereas sequential tasks share the remaining set of cores. Since parallel tasks are assigned dedicated cores, they receive no interference from other tasks. However, multicore processors are commonly built with shared main memory. The memory bandwidth is limited and therefore subject to contention. Consequently, parallel tasks can interfere with each other through the shared main memory. In this paper, we propose a novel method that is memory-aware when assigning cores to tasks. Our experimental results show a significant advantage of our method with respect to memory- oblivious methods.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.949
Threshold uncertainty score0.433

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.023
GPT teacher head0.254
Teacher spread0.231 · 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

Quick stats

Citations15
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicReal-Time Systems SchedulingFrench-language works237,207