{"id":"W2151954927","doi":"10.1109/hipc.1997.634496","title":"A hierarchical processor scheduling policy for distributed-memory multicomputer systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Partition (number theory); Scheduling (production processes); Distributed computing; Time-sharing; Parallel computing; Processor scheduling; Operating system; Schedule; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0003882439,0.0002906016,0.0003843199,0.0001877974,0.0003011806,0.0006923916,0.001390024,0.0001436562,0.000007727659],"category_scores_gemma":[0.0001597517,0.0002447822,0.0001708655,0.0006774688,0.0000512005,0.0003639676,0.0002773747,0.0001986916,0.000152963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009400969,"about_ca_system_score_gemma":0.00008046287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006199392,"about_ca_topic_score_gemma":0.00000129878,"domain_scores_codex":[0.997542,0.0000940994,0.0005454629,0.0006961825,0.0003666524,0.000755649],"domain_scores_gemma":[0.9983419,0.0003145804,0.0001567606,0.0006869014,0.0002184978,0.0002814013],"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.00003209667,0.001087724,0.0005127868,0.001255092,0.0002617672,0.00006908786,0.0027935,0.2544825,0.0003299418,0.6297523,0.04532011,0.06410311],"study_design_scores_gemma":[0.0008537482,0.00009423792,0.00007369339,0.000084413,0.00000544469,0.000080842,0.00002446227,0.9711328,0.00003930722,0.0005727859,0.02670112,0.0003371183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003191195,0.0003399751,0.9894096,0.002413318,0.0008301942,0.0007033793,0.00005139861,0.0008339094,0.002227047],"genre_scores_gemma":[0.9398019,0.000004086381,0.05735512,0.000333071,0.0009677437,0.0001124261,0.00003348737,0.00002081054,0.001371378],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9366107,"threshold_uncertainty_score":0.998193,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02813952596271976,"score_gpt":0.2631703731397961,"score_spread":0.2350308471770764,"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."}}