{"id":"W3075941581","doi":"10.1007/978-3-030-57675-2_8","title":"Parallel Scheduling of Data-Intensive Tasks","year":2020,"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 Waterloo","funders":"","keywords":"Computer science; Parallel computing; Scheduling (production processes); Locality; Directed acyclic graph; Cache; Distributed computing; Job shop scheduling; Algorithm; Operating system; Mathematical optimization; 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","open_science"],"consensus_categories":[],"category_scores_codex":[0.001030115,0.0006086633,0.0009961952,0.0004861893,0.0001739504,0.0004228019,0.009887765,0.000333481,0.000009349364],"category_scores_gemma":[0.0002931102,0.0005661758,0.0001612002,0.0007894043,0.0006349851,0.0007574194,0.004972906,0.0009771099,0.00007705352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001205932,"about_ca_system_score_gemma":0.0008649399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003810452,"about_ca_topic_score_gemma":0.00001592988,"domain_scores_codex":[0.9948435,0.00005866037,0.0009514973,0.00226854,0.001221581,0.0006562546],"domain_scores_gemma":[0.9946739,0.0005614283,0.0006969184,0.003107131,0.0007050549,0.0002555612],"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.00002615046,0.00005452833,0.0001015065,0.0003223846,0.0001074419,0.000430889,0.001947838,0.4125571,0.0002127596,0.09201843,0.0004638879,0.4917571],"study_design_scores_gemma":[0.0003056144,0.0001564556,0.0000251313,0.0006973349,0.00001386479,0.00008388257,5.524093e-7,0.9497405,0.0001318909,0.04474141,0.003473785,0.000629608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000240382,0.0008742146,0.9928225,0.001323308,0.001785759,0.0003724251,0.00005802059,0.0001993564,0.002540395],"genre_scores_gemma":[0.3316879,0.00003004946,0.6657324,0.001659942,0.0006636354,0.000002902686,0.0000790218,0.00003877503,0.0001054112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5371833,"threshold_uncertainty_score":0.999679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04864724566646964,"score_gpt":0.2786849660728876,"score_spread":0.230037720406418,"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."}}