{"id":"W1559991472","doi":"10.1007/11407522_16","title":"LOMARC — Lookahead Matchmaking for Multi-resource Coscheduling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Parallel computing; Scheduling (production processes); Workload; Schedule; Distributed computing; Context switch; Queue; Gang scheduling; Operating system; Computer network; Dynamic priority scheduling; Rate-monotonic scheduling; Mathematical optimization","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.001234761,0.0009098059,0.001303568,0.0007958289,0.001257665,0.001784744,0.00261421,0.0009352971,0.01557602],"category_scores_gemma":[0.002713266,0.0005267694,0.0005081299,0.001220579,0.0006029917,0.002017298,0.001833788,0.00159871,0.002735504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116098,"about_ca_system_score_gemma":0.002009658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00370312,"about_ca_topic_score_gemma":0.004836664,"domain_scores_codex":[0.9990919,0.0001617516,0.0000612195,0.0002035983,0.0002668005,0.0002148368],"domain_scores_gemma":[0.9990752,0.0002719997,0.0000592756,0.0003354175,0.0001745668,0.00008342872],"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.002212757,0.0004304368,0.0005289351,0.0003869161,0.0001080659,0.0002007886,0.0001284666,0.130859,0.02273774,0.0715828,0.03876233,0.7320617],"study_design_scores_gemma":[0.0001226267,0.0001920374,0.0002098006,0.00002965011,0.00004245786,0.0001284538,0.00004171307,0.9073715,0.0223452,0.05179661,0.01766771,0.00005222675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02363569,0.001127654,0.9414021,0.0003705078,0.0007702985,0.0002275111,0.0003571212,0.01033815,0.02177099],"genre_scores_gemma":[0.5548558,0.0004277957,0.4176385,0.0005236329,0.0002519389,0.000247628,0.0007384887,0.000934336,0.02438186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01557602,"threshold_uncertainty_score":0.05210692,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03323971504214483,"score_gpt":0.2921145699188136,"score_spread":0.2588748548766687,"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."}}