{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008647289,0.0005646925,0.0006360448,0.0004595511,0.0007803545,0.0007503837,0.001696433,0.0003321223,0.00157219],"category_scores_gemma":[0.00133744,0.0002113019,0.0004630269,0.0006576537,0.0004510955,0.0006911446,0.0007965383,0.0006707244,0.0002863057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001683069,"about_ca_system_score_gemma":0.001904314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005362047,"about_ca_topic_score_gemma":0.005980696,"domain_scores_codex":[0.999487,0.000103652,0.00004296243,0.00009961069,0.0001725793,0.00009410897],"domain_scores_gemma":[0.9993555,0.000192682,0.00006803731,0.00009159656,0.0001976014,0.00009460154],"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.0004446104,0.0002062968,0.001503156,0.0005437142,0.00009324048,0.0001874707,0.0002491611,0.7735956,0.05656977,0.01905174,0.003400944,0.1441543],"study_design_scores_gemma":[0.00002493216,0.00006934978,0.0001239208,0.000005926177,0.00001232583,0.00001683312,0.00001498367,0.9918979,0.004280889,0.002398065,0.00114458,0.00001013564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0300781,0.001007643,0.9655263,0.0001520167,0.0001116576,0.0001117919,0.00007946049,0.001138098,0.001795088],"genre_scores_gemma":[0.8368847,0.0005415195,0.159766,0.0001083275,0.00007772433,0.0001708121,0.0001731202,0.0001300891,0.002147662],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005362047,"threshold_uncertainty_score":0.01221162,"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."}}