MétaCan
Menu
Back to cohort
Record W2150690297 · doi:10.1109/icsmc.1995.538509

Adaptive scheduling of fault-tolerant parallel programs with timing constraints

2002· article· en· W2150690297 on OpenAlexaff
A. Srinivasan, Gholamali C. Shoja

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed and Parallel Computing Systems
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsComputer scienceMultiprocessingScheduling (production processes)Fault toleranceParallel computingScheduleFixed-priority pre-emptive schedulingProcessor schedulingPreemptionDistributed computingExecution timeReal-time computingDynamic priority schedulingRate-monotonic schedulingOperating systemEngineering

Abstract

fetched live from OpenAlex

We propose an adaptive preemptive scheduler for scheduling external sporadic tasks in a multiprocessor real-time system. We first present a pre-run-time scheduler to schedule a fault-tolerant parallel program with precedence constraints. Every task in the parallel program consists of two subtasks, namely, mandatory and optional. During run-time we optimally schedule the external tasks using the proposed adaptive scheduler. The scheduler removes the minimum number of optionals from the pre-run-time schedule to accommodate the external tasks. The performance of the system due to use of fault-tolerance is also demonstrated.

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.000
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: Methods · Consensus signal: none
Teacher disagreement score0.851
Threshold uncertainty score0.505

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.000
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.051
GPT teacher head0.236
Teacher spread0.185 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations0
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicDistributed and Parallel Computing SystemsFrench-language works237,207