{"id":"W2101252418","doi":"10.1109/ccece.2005.1557033","title":"Fault-tolerant scheduling of real-time tasks having software faults","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fixed-priority pre-emptive scheduling; Scheduling (production processes); Fair-share scheduling; Earliest deadline first scheduling; Dynamic priority scheduling; Two-level scheduling; Ethernet; Distributed computing; Embedded system; Rate-monotonic scheduling; Round-robin scheduling; Real-time computing; Parallel computing; Operating system; Schedule; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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.0005420127,0.0003431338,0.0004625215,0.0003308052,0.0004340922,0.0004203474,0.0008675928,0.0003327765,0.0005902827],"category_scores_gemma":[0.001741829,0.0001887814,0.0002629619,0.0004014074,0.0003242306,0.0006237642,0.0003139602,0.0003233711,0.0001292146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003952514,"about_ca_system_score_gemma":0.0005743007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007290429,"about_ca_topic_score_gemma":0.0005897114,"domain_scores_codex":[0.9996703,0.0000916401,0.00002841613,0.00006099123,0.00008597222,0.00006278571],"domain_scores_gemma":[0.9991276,0.0003036852,0.0001654553,0.0001593331,0.0001575795,0.00008642077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001382364,0.0002211436,0.002093932,0.0003325964,0.00007186775,0.0005646005,0.0003757834,0.6583068,0.1054963,0.02607935,0.00190131,0.2031738],"study_design_scores_gemma":[0.00006351054,0.0003716528,0.0008127132,0.000009353504,0.0000224702,0.0001611815,0.00006454348,0.9641288,0.02214897,0.009710873,0.002494499,0.00001129631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3815686,0.0004792314,0.6155523,0.000144805,0.0001313436,0.00006853751,0.00003583348,0.0003687246,0.001650663],"genre_scores_gemma":[0.9227935,0.0001875413,0.07603018,0.00002751199,0.00005402312,0.00004288262,0.0000537606,0.00003512554,0.0007755829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008675928,"threshold_uncertainty_score":0.002867758,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00979710778240044,"score_gpt":0.2330500163884449,"score_spread":0.2232529086060445,"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."}}