{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634719,0.0006012841,0.0008033951,0.0003936517,0.0006976248,0.001352505,0.001631395,0.00052049,0.003524743],"category_scores_gemma":[0.001864594,0.0005578341,0.0003644071,0.001224103,0.000577891,0.001390617,0.0007286796,0.0007667808,0.0007557638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007502382,"about_ca_system_score_gemma":0.0009589677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001404647,"about_ca_topic_score_gemma":0.002029718,"domain_scores_codex":[0.9995465,0.0001378891,0.00003151505,0.00005709104,0.0001491289,0.00007782678],"domain_scores_gemma":[0.9992558,0.0003513359,0.00005061606,0.0001689435,0.0001149233,0.00005833255],"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.0004983328,0.0001886603,0.0005926553,0.0006861834,0.0000927441,0.000253555,0.0003356835,0.4191858,0.01610113,0.2142116,0.02450008,0.3233535],"study_design_scores_gemma":[0.00009924753,0.0001317697,0.0003971113,0.00006936811,0.00004361362,0.0001341873,0.0001020489,0.7136551,0.008415385,0.2277782,0.04915177,0.00002213175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07398783,0.0192853,0.8628458,0.001000887,0.001625882,0.0001199708,0.0001547424,0.002088437,0.03889114],"genre_scores_gemma":[0.6821774,0.009396242,0.2716829,0.0002186709,0.0009511022,0.0002071077,0.0005543283,0.0005997474,0.03421252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003524743,"threshold_uncertainty_score":0.01179147,"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."}}