{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004576613,0.0006916515,0.0005776954,0.0007475577,0.0006861842,0.0006374403,0.0009054978,0.0003687383,0.003424334],"category_scores_gemma":[0.0008861902,0.000244734,0.000420884,0.0009477811,0.000326302,0.0006480473,0.0004314283,0.0007141794,0.0007319152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007086949,"about_ca_system_score_gemma":0.001758851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00301268,"about_ca_topic_score_gemma":0.002791858,"domain_scores_codex":[0.999827,0.000033725,0.00001484872,0.0000420409,0.00005313829,0.00002929737],"domain_scores_gemma":[0.9997395,0.00007798387,0.0000259381,0.00003840644,0.00009414108,0.00002398464],"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.000437639,0.0001088155,0.0008413914,0.0003749334,0.00004630435,0.0002096827,0.0003439034,0.1572253,0.04112542,0.06986214,0.01509364,0.7143308],"study_design_scores_gemma":[0.0001253981,0.00025154,0.000643827,0.0000670034,0.00004260799,0.0004189906,0.00009923239,0.8990759,0.01803751,0.03975732,0.04142008,0.00006061629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007073764,0.0006069273,0.9881679,0.00007163292,0.000124987,0.00007783715,0.00006375601,0.0008918217,0.002921356],"genre_scores_gemma":[0.108316,0.0004919269,0.8866219,0.00007176343,0.00005821621,0.0001541959,0.0002682595,0.0002108281,0.003806979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003424334,"threshold_uncertainty_score":0.0114556,"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."}}