{"id":"W2480244369","doi":"10.1007/978-1-4615-0133-6_7","title":"Scheduling in Shared-Memory Multiprocessors","year":2003,"lang":"en","type":"book-chapter","venue":"Plenum series in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scheduling (production processes); Parallel computing; Distributed computing; Workload; Equipartition theorem; Dynamic priority scheduling; Shared memory; Computer network; Mathematical optimization; Mathematics; Operating system; Quality of service","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.001779792,0.0006718245,0.0008065372,0.001083746,0.000277016,0.0009489753,0.005096005,0.000331643,0.0000247158],"category_scores_gemma":[0.00008842967,0.0007171506,0.0001367336,0.001101333,0.0005910546,0.001875478,0.001640279,0.0009169964,0.0001322563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004129275,"about_ca_system_score_gemma":0.0007027469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004069223,"about_ca_topic_score_gemma":0.00007431395,"domain_scores_codex":[0.994673,0.00006649087,0.001027256,0.002013026,0.001128413,0.001091783],"domain_scores_gemma":[0.9973145,0.0001738619,0.0004434865,0.001559815,0.0002644118,0.0002439898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005115438,0.0003529568,0.001970722,0.001118235,0.00006209257,0.001946639,0.01288202,0.3830713,0.0001241145,0.4527554,0.002589762,0.1430756],"study_design_scores_gemma":[0.00136421,0.0003116769,0.000861147,0.003439654,0.000008430315,0.0004393135,0.00003407637,0.8930665,0.0001701141,0.03545746,0.06193708,0.002910355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002340104,0.001816453,0.8770494,0.0008985258,0.008481129,0.00108485,0.00004783937,0.0006617088,0.10762],"genre_scores_gemma":[0.3054235,0.000352298,0.6423212,0.002517163,0.001379315,0.0001157081,0.00008052064,0.0002296363,0.04758072],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5099952,"threshold_uncertainty_score":0.9995279,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01966501407501688,"score_gpt":0.2388403438822593,"score_spread":0.2191753298072424,"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."}}