{"id":"W2150690297","doi":"10.1109/icsmc.1995.538509","title":"Adaptive scheduling of fault-tolerant parallel programs with timing constraints","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Multiprocessing; Scheduling (production processes); Fault tolerance; Parallel computing; Schedule; Fixed-priority pre-emptive scheduling; Processor scheduling; Preemption; Distributed computing; Execution time; Real-time computing; Dynamic priority scheduling; Rate-monotonic scheduling; Operating system; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001995088,0.0001670923,0.0002623311,0.00005766454,0.00008805204,0.0001087138,0.0006023565,0.00005488915,0.00003591068],"category_scores_gemma":[0.000008886953,0.0001238671,0.00006325718,0.0003603829,0.0001374352,0.0001555282,0.00009383819,0.0001207927,0.00005222739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001647495,"about_ca_system_score_gemma":0.00003045639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003514067,"about_ca_topic_score_gemma":0.000004903061,"domain_scores_codex":[0.9986169,0.00005538141,0.0003160265,0.000352261,0.0003202436,0.0003392336],"domain_scores_gemma":[0.9991454,0.00006145493,0.0001678926,0.0003786949,0.0001433657,0.0001032311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000055741,0.001132728,0.006626564,0.0001897833,0.0004322233,0.0002398745,0.00923475,0.1465496,0.0002968546,0.2596657,0.000833184,0.574743],"study_design_scores_gemma":[0.0006430697,0.0003016926,0.0001582415,0.000214713,0.000006811855,0.00009175218,0.0002522841,0.9973759,0.00007330413,0.0001317722,0.0005139103,0.000236539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02694513,0.0001204721,0.9534057,0.0001448085,0.0001041588,0.0002453862,0.00000174399,0.0001905367,0.01884205],"genre_scores_gemma":[0.8012084,0.000001762689,0.1984986,0.00003895253,0.00002564373,0.000007505325,0.000001732082,0.000006107302,0.0002112126],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8508263,"threshold_uncertainty_score":0.5051154,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05127702399981399,"score_gpt":0.2363222347565206,"score_spread":0.1850452107567066,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}