{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065344,0.000587895,0.0005273783,0.0006595578,0.0004173699,0.0007143854,0.0008494828,0.0003094049,0.001943192],"category_scores_gemma":[0.003262907,0.0003949092,0.0004375064,0.0006089139,0.0004519164,0.00104196,0.000523934,0.0005115114,0.0003451995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007960428,"about_ca_system_score_gemma":0.001628849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001885182,"about_ca_topic_score_gemma":0.002642314,"domain_scores_codex":[0.9992579,0.0002111478,0.00004289695,0.0001198675,0.000237737,0.0001304565],"domain_scores_gemma":[0.9987471,0.0005329404,0.0002615197,0.0002255903,0.0001708478,0.00006194415],"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.0001906127,0.00007534173,0.0006194431,0.0001244414,0.00002121855,0.00006947494,0.0001168604,0.8664672,0.02200075,0.03112998,0.0009403818,0.07824428],"study_design_scores_gemma":[0.00003856038,0.0001620518,0.0002412866,0.00001406055,0.00001752323,0.00003633838,0.0000353572,0.9665648,0.01369164,0.01676778,0.002416766,0.00001388019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1146221,0.0002600308,0.8793235,0.0001397294,0.00003723957,0.0001128107,0.0001132979,0.0007472174,0.004644105],"genre_scores_gemma":[0.5404359,0.0003336921,0.4557607,0.00006103347,0.00003392634,0.0002237466,0.0002717268,0.0004103819,0.002468877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001943192,"threshold_uncertainty_score":0.006500661,"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."}}