{"id":"W1967936195","doi":"10.1023/b:supe.0000040613.43581.53","title":"Feedback Guided Dynamic Loop Scheduling: Convergence of the Continuous Case","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Convergence (economics); Scheduling (production processes); Workload; Loop (graph theory); Mathematical optimization; Feedback loop; Parallel computing; Distributed computing; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.001746216,0.0001515448,0.0002844788,0.00007625833,0.0003169118,0.0000663438,0.001786613,0.00005819277,0.000003433142],"category_scores_gemma":[0.0001754358,0.00008843986,0.0001722543,0.0005446815,0.0001485808,0.0002692311,0.0004394508,0.0003834175,0.000003227091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006632718,"about_ca_system_score_gemma":0.0002230485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008125801,"about_ca_topic_score_gemma":0.000005126169,"domain_scores_codex":[0.9982383,0.0002289331,0.0007790287,0.0001361052,0.0003676265,0.0002500443],"domain_scores_gemma":[0.9981017,0.0002200122,0.0006075394,0.0005226346,0.0004811063,0.00006708266],"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.0000148517,0.000159279,0.001897307,0.00003686966,0.0000967216,0.0002437807,0.006341851,0.9748116,0.004492063,0.004412036,0.000281036,0.007212675],"study_design_scores_gemma":[0.001835976,0.0003408241,0.00303253,0.0008224145,0.0001052842,0.03314627,0.0009042275,0.9238591,0.02814016,0.007277706,0.00008913044,0.0004463758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.503697,0.000331291,0.4946468,0.0008311085,0.0003214326,0.00006922468,2.964379e-7,0.00003793323,0.00006484767],"genre_scores_gemma":[0.8740399,0.00004008748,0.1256222,0.0002097512,0.0000577612,1.914989e-7,9.078718e-8,0.000009117611,0.00002089684],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3703429,"threshold_uncertainty_score":0.3606473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01889259081758587,"score_gpt":0.2653310294289088,"score_spread":0.2464384386113229,"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."}}