{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007282818,0.002144064,0.002825689,0.005109374,0.001101403,0.003118466,0.005098851,0.002460526,0.007020902],"category_scores_gemma":[0.02767505,0.0006918128,0.001470465,0.004151165,0.001387847,0.005741075,0.001679943,0.001272995,0.0007472624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004414175,"about_ca_system_score_gemma":0.002468733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003453133,"about_ca_topic_score_gemma":0.002953295,"domain_scores_codex":[0.9944177,0.00155576,0.0002728278,0.0007385311,0.002150214,0.0008650301],"domain_scores_gemma":[0.9652652,0.02974446,0.0009513886,0.001827217,0.001798697,0.0004130555],"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.009212777,0.0007472119,0.004555193,0.001774861,0.0004700721,0.0002729527,0.0001616113,0.5557484,0.01100535,0.03189901,0.006809385,0.3773432],"study_design_scores_gemma":[0.0001934919,0.0004919373,0.001768569,0.0001200344,0.0002059508,0.0002875143,0.00009888198,0.9694809,0.008290688,0.01766225,0.001347713,0.00005204561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2710466,0.05271526,0.6155866,0.001994033,0.001111693,0.0005018967,0.001828858,0.003899917,0.05131514],"genre_scores_gemma":[0.841397,0.00409807,0.1474517,0.0003031059,0.0004627197,0.0003084192,0.00140305,0.000492317,0.004083663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007282818,"threshold_uncertainty_score":0.03851569,"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."}}