{"id":"W4231100297","doi":"10.4018/978-1-4666-0264-9.ch017","title":"A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nipissing University","funders":"","keywords":"Computer science; Scheduling (production processes); Algorithm; Dynamic priority scheduling; Task (project management); Mathematical optimization; Mathematics; Engineering; Computer network; Quality of service","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005067289,0.0005552759,0.0007676048,0.0001057066,0.0003058684,0.0001706431,0.001168667,0.0005086274,0.0000328459],"category_scores_gemma":[0.00004370763,0.0005911093,0.0003700366,0.00006418562,0.0001525514,0.0001144908,0.0007617337,0.0004147904,0.0001710174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001717124,"about_ca_system_score_gemma":0.0003506391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005576836,"about_ca_topic_score_gemma":0.000007234075,"domain_scores_codex":[0.9974282,0.00003306094,0.0005686451,0.0008055543,0.0004482006,0.0007163276],"domain_scores_gemma":[0.9977014,0.0002534998,0.000480779,0.0007976156,0.0005043539,0.0002623224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002250243,0.00003174204,0.000004487085,0.00009986613,0.0001661089,0.000008446111,0.0001271462,0.00006903418,0.0000142236,0.7913049,0.001006098,0.2071454],"study_design_scores_gemma":[0.002619749,0.0008254389,0.00004134514,0.003391228,0.0005594453,0.0003229505,0.00001381849,0.2761894,0.0001723696,0.4273672,0.2855969,0.002900179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001400467,0.001322956,0.5383418,0.0000322186,0.0006687921,0.0004332646,0.0001343833,0.0002006787,0.458852],"genre_scores_gemma":[0.04903825,0.00003475737,0.8277005,0.001309896,0.004789483,0.0001233238,0.00005649724,0.0002429346,0.1167044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3639378,"threshold_uncertainty_score":0.9996541,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01775997617822033,"score_gpt":0.234486592654145,"score_spread":0.2167266164759246,"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."}}