{"id":"W2098278566","doi":"10.1145/1735970.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":511,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Multi-core processor; Thread (computing); Gang scheduling; Shared memory; Cache; Fair-share scheduling; Parallel computing; Quality of service; Two-level scheduling; Operating system; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001880405,0.0005064114,0.0007483267,0.0007081045,0.0009730431,0.001152921,0.001241867,0.0005066954,0.0006671574],"category_scores_gemma":[0.005450332,0.0003192773,0.0003948855,0.001273553,0.0009891071,0.001673408,0.000905154,0.0007569102,0.0001420085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056796,"about_ca_system_score_gemma":0.002088278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002015735,"about_ca_topic_score_gemma":0.003094094,"domain_scores_codex":[0.9985637,0.0005436274,0.00009393904,0.0001388525,0.0004489216,0.0002110325],"domain_scores_gemma":[0.9969626,0.001372705,0.0003902082,0.0006609313,0.0004785278,0.0001350862],"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.0004865861,0.0002704799,0.006501043,0.0003018276,0.0001237654,0.0001971718,0.000367399,0.5842161,0.05703378,0.04904791,0.003083518,0.2983704],"study_design_scores_gemma":[0.00003417985,0.0001474192,0.000482622,0.00001335663,0.00003105017,0.00005552585,0.00005728182,0.9614737,0.01595741,0.0186908,0.003040371,0.00001630409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1782988,0.001627915,0.8148013,0.0004213653,0.000141193,0.0001254515,0.00002533663,0.001200742,0.003357917],"genre_scores_gemma":[0.763805,0.0004936866,0.2342891,0.0001038544,0.00009484985,0.0000838354,0.00004213547,0.0001121544,0.0009753223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002015735,"threshold_uncertainty_score":0.009944677,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03583677900696412,"score_gpt":0.2961899832905564,"score_spread":0.2603532042835923,"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."}}