{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003374401,0.0003314397,0.0002504603,0.000207826,0.000300439,0.0002353301,0.0008424244,0.0001845662,0.000598438],"category_scores_gemma":[0.0009562565,0.0002028556,0.0001926383,0.0002573536,0.000281376,0.0003857207,0.0002930709,0.0004215335,0.00009689691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003230858,"about_ca_system_score_gemma":0.0006456493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009482924,"about_ca_topic_score_gemma":0.001449666,"domain_scores_codex":[0.9997951,0.00005216015,0.00001420572,0.00003573245,0.00006891684,0.00003388253],"domain_scores_gemma":[0.999546,0.0001602748,0.00008839639,0.00006668222,0.00008839808,0.00005019824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007000997,0.0002526326,0.002470026,0.0001972939,0.00006648039,0.0004137906,0.0002111687,0.6668429,0.1447713,0.01652605,0.001663002,0.1658853],"study_design_scores_gemma":[0.00007163703,0.0001768069,0.0005387979,0.000004551974,0.00002365844,0.00007026277,0.0000160725,0.9734576,0.01882259,0.004737699,0.002068461,0.00001197539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2512201,0.0003397518,0.7452682,0.0001642174,0.00006686563,0.00008222512,0.00003745521,0.0009064231,0.001914607],"genre_scores_gemma":[0.8484996,0.0002269564,0.1495551,0.00004942574,0.00005128242,0.00009450271,0.00009091843,0.00008145509,0.001350778],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0009482924,"threshold_uncertainty_score":0.002344191,"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."}}