{"id":"W2166671255","doi":"10.1109/pacrim.1995.519442","title":"Rate-optimal static scheduling for DSP data flow graphs onto multiprocessors","year":2002,"lang":"en","type":"article","venue":"","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Parallel computing; Directed acyclic graph; Multiprocessor scheduling; Fair-share scheduling; Rate-monotonic scheduling; Data-flow analysis; Dynamic priority scheduling; Scheduling (production processes); Multiprocessing; Schedule; Data flow diagram; Earliest deadline first scheduling; Algorithm; Mathematical optimization; Mathematics; Operating system","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.0007242433,0.0005692407,0.0004433334,0.0007351773,0.0004575455,0.0004506063,0.0005913842,0.0002708652,0.001319847],"category_scores_gemma":[0.002073155,0.0003528151,0.0004889358,0.0005612198,0.0004538283,0.0006676275,0.0003877778,0.0004097229,0.0002058307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009267194,"about_ca_system_score_gemma":0.001275827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001996032,"about_ca_topic_score_gemma":0.002581921,"domain_scores_codex":[0.9996368,0.00009006726,0.00001775347,0.00004920203,0.0001399266,0.00006628943],"domain_scores_gemma":[0.999396,0.0002869844,0.00009865776,0.00006421558,0.0001212166,0.00003298091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000157884,0.00007302543,0.000456638,0.0001570683,0.00001718508,0.00009891266,0.0000942526,0.8222601,0.03872353,0.03014134,0.0008696162,0.1069504],"study_design_scores_gemma":[0.00002840443,0.0001211249,0.0002294806,0.00001082402,0.00001431468,0.00004930194,0.00002934672,0.9636958,0.01673779,0.01690993,0.002161804,0.00001180823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08619457,0.0002495307,0.9088504,0.0001067286,0.00003443778,0.00008281128,0.00008051697,0.0005725908,0.00382843],"genre_scores_gemma":[0.6038895,0.0004566766,0.3919602,0.00005639249,0.00004240149,0.0001659918,0.0002994861,0.0002947164,0.002834603],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001996032,"threshold_uncertainty_score":0.006723821,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09631358665530161,"score_gpt":0.3046636865791995,"score_spread":0.2083500999238979,"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."}}