{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005965667,0.0003483513,0.0003671495,0.0005634263,0.0002544684,0.0004568528,0.002671339,0.000205647,0.000009469763],"category_scores_gemma":[0.0003570384,0.000323881,0.0001281211,0.0008106343,0.0001041999,0.0003825691,0.001291146,0.001264666,0.00001362378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003961035,"about_ca_system_score_gemma":0.00009370051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008702186,"about_ca_topic_score_gemma":0.0001642326,"domain_scores_codex":[0.9971997,0.0002224208,0.0005568389,0.0009120731,0.0004728709,0.0006360968],"domain_scores_gemma":[0.9976546,0.0004256958,0.0002196128,0.001335859,0.0001632235,0.0002009949],"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.00004434001,0.0002315556,0.005615556,0.00009795051,0.00002888508,0.00007257369,0.005559814,0.1253448,0.01192146,0.0008794933,0.0007777648,0.8494258],"study_design_scores_gemma":[0.000978102,0.0001221367,0.00504016,0.0002361143,0.00000489834,0.00009334418,0.00001175694,0.9791233,0.00281495,0.007675485,0.003413245,0.000486516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07983054,0.00005629673,0.9160228,0.002070299,0.0003417424,0.0004443374,0.00000136185,0.0008999381,0.0003326581],"genre_scores_gemma":[0.4172905,0.000002255767,0.5817139,0.0006830686,0.0002249908,0.00002570026,0.00001311854,0.00002187723,0.00002460978],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8537785,"threshold_uncertainty_score":0.9999213,"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."}}