{"id":"W1574558803","doi":"10.1007/978-3-540-74742-0_5","title":"Number of Processors with Partitioning Strategy and EDF-Schedulability Test: Upper and Lower Bounds with Comparison","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Upper and lower bounds; Parallel computing; Schedule; Scheduling (production processes); Heuristic; Processor scheduling; Branch and bound; Time complexity; Set (abstract data type); Job shop scheduling; Worst-case execution time; Execution time; Mathematical optimization; Algorithm; Mathematics","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.001269978,0.0005597179,0.0007862945,0.0003498639,0.0002498013,0.0007246792,0.001011841,0.0002795261,0.00001092538],"category_scores_gemma":[0.00007442217,0.0004197101,0.00004303691,0.0006649237,0.001742395,0.001017192,0.0006270818,0.0006954999,0.000003914638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223708,"about_ca_system_score_gemma":0.0005851888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008634156,"about_ca_topic_score_gemma":0.0002275947,"domain_scores_codex":[0.9960248,0.00003608426,0.0006813379,0.001575331,0.001056236,0.0006262157],"domain_scores_gemma":[0.9971408,0.0006463822,0.0005300464,0.0009514525,0.0004974799,0.0002338513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002081952,0.0004753146,0.4597615,0.00184612,0.0001502265,0.0003186328,0.007776668,0.08101157,0.0004883998,0.05281416,0.000008497744,0.3951407],"study_design_scores_gemma":[0.002260969,0.003259222,0.03597511,0.006271344,0.00009350612,0.001739992,0.00001742475,0.8784878,0.004683965,0.06361322,0.0003337055,0.003263733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04785223,0.0003333294,0.9453556,0.0001115957,0.0001685549,0.0004786548,0.000002805604,0.00008762363,0.005609583],"genre_scores_gemma":[0.678714,0.000006668404,0.3210131,0.0000767965,0.00008034531,0.000006427962,0.000001434156,0.00002429424,0.000076909],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7974762,"threshold_uncertainty_score":0.9998255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01809301665654706,"score_gpt":0.2738050108578994,"score_spread":0.2557119942013524,"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."}}