{"id":"W2384806434","doi":"10.1145/2846096","title":"Minimizing Stack Memory for Hard Real-Time Applications on Multicore Platforms with Partitioned Fixed-Priority or EDF Scheduling","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Preemption; Multi-core processor; Scheduling (production processes); Parallel computing; Fixed-priority pre-emptive scheduling; Dynamic priority scheduling; Integer programming; Fair-share scheduling; Distributed computing; Earliest deadline first scheduling; Rate-monotonic scheduling; Algorithm; Operating system; Mathematical optimization; Quality of service; Computer network","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.00131199,0.0003914979,0.0005787727,0.0004351275,0.0004653654,0.0001732877,0.000979614,0.0002149967,0.0000305577],"category_scores_gemma":[0.0001344117,0.0002661042,0.00016892,0.0006922662,0.00007438239,0.001125888,0.00001118782,0.0001904878,0.0001678101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006486363,"about_ca_system_score_gemma":0.0006449716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004288595,"about_ca_topic_score_gemma":0.00001215175,"domain_scores_codex":[0.9966034,0.0002011342,0.0009922236,0.0008017541,0.000677311,0.0007241805],"domain_scores_gemma":[0.995006,0.002099189,0.0006997907,0.001595242,0.0004335984,0.0001661357],"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.002434068,0.002048353,0.00005983418,0.001503567,0.001540792,0.00001027088,0.002698684,0.5505698,0.2811399,0.04108606,0.0005027948,0.1164059],"study_design_scores_gemma":[0.00670852,0.00353811,0.0001735616,0.001937755,0.0001745065,0.0001239223,0.0004527207,0.8404753,0.143043,0.001934192,0.0003431886,0.001095327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01653903,0.0000442468,0.9787272,0.0003481775,0.0001691247,0.003377478,0.00002755098,0.0006697715,0.0000974668],"genre_scores_gemma":[0.782316,0.00004182425,0.2142021,0.00002077139,0.00009180591,0.002287426,0.00001025366,0.00005641582,0.0009734214],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7657769,"threshold_uncertainty_score":0.9999791,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0343571888096782,"score_gpt":0.2681399171626417,"score_spread":0.2337827283529635,"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."}}