{"id":"W2912041116","doi":"10.1109/mwscas.2018.8623930","title":"Local Queueing-Based Data-Driven Task Scheduling for Multicore Systems","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multi-core processor; Distributed computing; Dynamic priority scheduling; Scheduling (production processes); Preemption; Fixed-priority pre-emptive scheduling; Fair-share scheduling; Two-level scheduling; Rate-monotonic scheduling; Queueing theory; Queue; Parallel computing; Job shop scheduling; Round-robin scheduling; Critical path method; Embedded system; Computer network; Operating system; Mathematical optimization; Engineering; Quality of service","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0006067066,0.000186625,0.0002558923,0.00007518187,0.0002575985,0.0004549576,0.002317694,0.00009500956,0.000004505599],"category_scores_gemma":[0.00007845631,0.0001578283,0.00006126193,0.0002736506,0.00009491298,0.0003401818,0.0004011409,0.00008797949,0.0001686101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004501198,"about_ca_system_score_gemma":0.0001764447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002829568,"about_ca_topic_score_gemma":0.00004300784,"domain_scores_codex":[0.9981242,0.00008018602,0.0003749474,0.0007067598,0.0002697636,0.0004440809],"domain_scores_gemma":[0.9976962,0.0002485155,0.0001382614,0.001497516,0.0002758612,0.0001436917],"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.00006474812,0.0003453569,0.001421133,0.0005840428,0.0001923386,0.00003216894,0.0007226059,0.7707903,0.0009871395,0.1539854,0.05225413,0.01862066],"study_design_scores_gemma":[0.0005413344,0.0001256774,0.00003723419,0.000104661,0.00000746969,0.000008624552,0.00004299358,0.9625028,0.0001350281,0.00006271332,0.03621025,0.0002212333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002035872,0.00008421079,0.994073,0.0002639372,0.001715021,0.0004341693,0.00005672182,0.0005289464,0.0008080663],"genre_scores_gemma":[0.8957194,2.226914e-7,0.103283,0.0002114679,0.0004508937,0.00001930818,0.000113585,0.00001350396,0.0001886211],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8936836,"threshold_uncertainty_score":0.643605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05311271104889811,"score_gpt":0.2987363858203093,"score_spread":0.2456236747714112,"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."}}