{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002378658,0.001470163,0.001556349,0.001210988,0.001131815,0.002073987,0.003911864,0.001437375,0.005449882],"category_scores_gemma":[0.007556906,0.000781356,0.001054083,0.002812071,0.0008574005,0.002871411,0.002194425,0.004027812,0.0009598059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002943214,"about_ca_system_score_gemma":0.002440308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005399888,"about_ca_topic_score_gemma":0.007881583,"domain_scores_codex":[0.9984713,0.000443923,0.00006566387,0.0002285281,0.0004830232,0.0003074971],"domain_scores_gemma":[0.9961141,0.002169386,0.0001994655,0.0008289475,0.000478566,0.0002094275],"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.0008578445,0.0004159266,0.0006984734,0.0001736336,0.00008405907,0.0000708838,0.0001426296,0.6592075,0.004330216,0.06126119,0.01115383,0.261604],"study_design_scores_gemma":[0.00002485917,0.00002648146,0.0000642123,0.000007165063,0.00001005022,0.00001571399,0.000009095566,0.9823195,0.0005393294,0.01609659,0.0008822707,0.000004623158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01622294,0.0007502526,0.9756891,0.0003084812,0.0002880584,0.00006251827,0.00008298589,0.001007116,0.00558855],"genre_scores_gemma":[0.2490303,0.0004663284,0.7428568,0.0001955887,0.0002486793,0.0002102851,0.0003708841,0.0003812368,0.006239852],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005449882,"threshold_uncertainty_score":0.02135462,"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."}}