{"id":"W3137917418","doi":"10.1145/1735971.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Thread (computing); Shared memory; Multi-core processor; Gang scheduling; Cache; Parallel computing; Fair-share scheduling; 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.001925885,0.0005228564,0.0007526352,0.000721991,0.001005539,0.001199649,0.001335541,0.0005228365,0.0006993225],"category_scores_gemma":[0.005663478,0.0003290128,0.0004024338,0.001297493,0.0009974022,0.001721945,0.0009472453,0.0007538609,0.0001456024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0010861,"about_ca_system_score_gemma":0.002207359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002144804,"about_ca_topic_score_gemma":0.003330721,"domain_scores_codex":[0.998459,0.0005783308,0.0001048506,0.0001537816,0.0004738723,0.0002302232],"domain_scores_gemma":[0.9967265,0.001447768,0.0004247233,0.0007188417,0.000533575,0.0001484987],"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.0005129668,0.0002877236,0.007251935,0.0003203838,0.0001329134,0.0002148177,0.000399677,0.5827483,0.0598671,0.04733198,0.003105709,0.2978265],"study_design_scores_gemma":[0.00003563484,0.0001548598,0.0005182026,0.0000140274,0.00003495677,0.00006004025,0.00006427387,0.9597975,0.01749358,0.01860352,0.003206088,0.00001726618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1818963,0.001557788,0.8112563,0.0004110327,0.0001390819,0.0001319359,0.00002609546,0.001240359,0.003341005],"genre_scores_gemma":[0.766964,0.0004605253,0.2311501,0.0001039255,0.0000923897,0.00008433071,0.00004356442,0.0001132934,0.0009878285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002144804,"threshold_uncertainty_score":0.01018518,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05763234658827183,"score_gpt":0.3106199538624083,"score_spread":0.2529876072741365,"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."}}