{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770932,0.0005009273,0.0007574792,0.0006669632,0.0009670394,0.001094862,0.001181903,0.0004905517,0.0006117614],"category_scores_gemma":[0.005162813,0.0002947474,0.0003790263,0.001189285,0.000971821,0.001536534,0.0008225659,0.000685479,0.0001298263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022211,"about_ca_system_score_gemma":0.001950466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001922583,"about_ca_topic_score_gemma":0.002781302,"domain_scores_codex":[0.9986978,0.0004880997,0.00008768219,0.0001340303,0.0004013582,0.0001911541],"domain_scores_gemma":[0.9970598,0.001318368,0.0003953026,0.0006111208,0.0004822543,0.0001331943],"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.0004694681,0.0002639056,0.006568035,0.0002931372,0.000122051,0.0002074446,0.000350654,0.6053852,0.06005951,0.04515345,0.002594134,0.2785331],"study_design_scores_gemma":[0.00003443695,0.0001370971,0.0004890519,0.00001219283,0.00003054383,0.00005780231,0.00005315754,0.9619641,0.01730966,0.01719121,0.002704868,0.00001588313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1869342,0.001370698,0.8070388,0.0003596155,0.0001250915,0.0001188237,0.00002353203,0.00105942,0.002969776],"genre_scores_gemma":[0.7730381,0.0004344338,0.2252837,0.00008907486,0.00008302761,0.00008102805,0.0000400336,0.00009937256,0.0008511912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001922583,"threshold_uncertainty_score":0.009365678,"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."}}