{"id":"W1545045518","doi":"10.1109/asap.1994.331814","title":"Minimizing memory requirements in rate-optimal schedules","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Ministère de la Transition écologique et Solidaire","keywords":"Dataflow; Computer science; Software pipelining; Scheduling (production processes); Testbed; Computation; Compiler; Parallel computing; Job shop scheduling; Block (permutation group theory); Mathematical optimization; Algorithm; Schedule; Mathematics; Programming language; Operating system; Computer network","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.0003784576,0.0001025267,0.0001161941,0.0001711564,0.00006701495,0.0001105985,0.0005664772,0.00004719766,0.00009972197],"category_scores_gemma":[0.00004308427,0.00009747523,0.000031806,0.0003589028,0.00002143927,0.0004140006,0.0001932277,0.00008913079,0.00009385969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003269097,"about_ca_system_score_gemma":0.00000942413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001508852,"about_ca_topic_score_gemma":0.000002490741,"domain_scores_codex":[0.9990085,0.00009046161,0.0002306497,0.0002924829,0.000137322,0.0002406241],"domain_scores_gemma":[0.9994787,0.00004820725,0.000052278,0.0003334906,0.00003625646,0.00005106515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002765124,0.001562164,0.01243247,0.00009257662,0.00008106275,0.0002848397,0.005580844,0.2340499,0.003729902,0.358274,0.05592435,0.3279602],"study_design_scores_gemma":[0.0002792889,0.00003277843,0.0004873954,0.00002395885,7.775914e-7,0.000003166833,0.00002028975,0.9926053,0.005197262,0.0005620906,0.0006232129,0.0001645366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01860026,0.0001411826,0.9460142,0.0006535714,0.0001082719,0.0000923484,1.095548e-7,0.0005996582,0.03379041],"genre_scores_gemma":[0.440958,0.00003180623,0.557428,0.0004154275,0.000017145,0.000006313669,4.259109e-7,0.000004777242,0.001138081],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7585553,"threshold_uncertainty_score":0.3974924,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04419028858714385,"score_gpt":0.2706454820936643,"score_spread":0.2264551935065204,"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."}}