{"id":"W4240262711","doi":"10.1145/1736020.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":344,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Multi-core processor; Gang scheduling; Thread (computing); Shared memory; Cache; Processor scheduling; Fair-share scheduling; Dynamic priority scheduling; Parallel computing; Quality of service; Two-level scheduling; Operating system; Resource (disambiguation); 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":[],"consensus_categories":[],"category_scores_codex":[0.0003403355,0.00009380038,0.0001065489,0.0001606901,0.00009965518,0.0001999249,0.0005106737,0.00008280004,0.00001442805],"category_scores_gemma":[0.0001307312,0.00008676093,0.00002981371,0.000350223,0.00002527763,0.0004006711,0.0001434037,0.0002524082,0.00001065353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001365932,"about_ca_system_score_gemma":0.00002650299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003792387,"about_ca_topic_score_gemma":0.00003637587,"domain_scores_codex":[0.9991044,0.00003354781,0.0002206324,0.00029564,0.0001485196,0.0001972457],"domain_scores_gemma":[0.9994478,0.00004593838,0.00008373996,0.0002797742,0.00008928293,0.00005343516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008361356,0.001119101,0.05631518,0.0002750075,0.00004409232,0.0001002658,0.0100644,0.1306788,0.1536525,0.06834473,0.002905386,0.5764169],"study_design_scores_gemma":[0.0002514873,0.00001267447,0.002052197,0.0000526788,7.803631e-7,0.000006857177,0.00001958722,0.9897052,0.006669715,0.0007929776,0.0003059413,0.000129895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06319378,0.00001988798,0.932258,0.0003432972,0.0000882384,0.0001220565,1.596364e-7,0.0006648217,0.003309724],"genre_scores_gemma":[0.592195,6.939415e-7,0.4074965,0.0001335698,0.00001808175,0.000006732712,0.00000210606,0.000004533593,0.0001426878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8590264,"threshold_uncertainty_score":0.3538008,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04936813286589711,"score_gpt":0.3051726721502294,"score_spread":0.2558045392843323,"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."}}