{"id":"W4408128180","doi":"10.1007/978-981-96-1090-7_16","title":"Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Multiprocessing; Parallel computing; Multiprocessor scheduling; Scheduling (production processes); Approximation algorithm; Processor scheduling; Algorithm; Fair-share scheduling; Mathematical optimization; Rate-monotonic scheduling; Operating system; Mathematics; Schedule","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001488346,0.0006336929,0.0007279036,0.0009469163,0.000470937,0.001131497,0.003846887,0.0004694228,0.0000028804],"category_scores_gemma":[0.0002488673,0.000607581,0.0002142534,0.0009275016,0.0002642138,0.0006123367,0.001052013,0.0006732569,0.00001165385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003017212,"about_ca_system_score_gemma":0.001147369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002001867,"about_ca_topic_score_gemma":0.00001414613,"domain_scores_codex":[0.9956641,0.00003346357,0.0007990982,0.001908265,0.0007412723,0.0008538454],"domain_scores_gemma":[0.9966863,0.0007709048,0.0005132787,0.001248993,0.0006174797,0.0001630878],"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.00001101221,0.00005204956,0.00002044026,0.0004488196,0.00003484551,0.00001014151,0.000659567,0.1284422,0.0001612439,0.01878987,0.00006076663,0.8513091],"study_design_scores_gemma":[0.0005799946,0.0001347266,0.000009196428,0.000784797,0.00001108822,0.00001490786,2.399539e-7,0.9510466,0.0009273862,0.04410743,0.001760155,0.000623471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002268099,0.0004974458,0.993206,0.0004157277,0.00304838,0.001235554,0.00003993416,0.0003507274,0.001183565],"genre_scores_gemma":[0.05857864,0.00001228939,0.9391763,0.0006049903,0.0006415005,0.00006406255,0.00006602058,0.00003384902,0.0008223846],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8506855,"threshold_uncertainty_score":0.9999054,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02145702769444509,"score_gpt":0.2667064251843828,"score_spread":0.2452493974899377,"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."}}