{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009808778,0.0002183764,0.0002649502,0.0001616342,0.0001538103,0.000305152,0.002749855,0.00009191962,0.00004544545],"category_scores_gemma":[0.000255503,0.000191577,0.00006258974,0.0003966824,0.00003830731,0.00159958,0.000430571,0.000123427,0.00007752243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003946359,"about_ca_system_score_gemma":0.00003564234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005900042,"about_ca_topic_score_gemma":0.00004165048,"domain_scores_codex":[0.9979656,0.0000954975,0.000422159,0.0007855118,0.0002762515,0.0004549746],"domain_scores_gemma":[0.9974646,0.0003429204,0.0001301011,0.001769084,0.0001641348,0.0001291875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009582775,0.001628512,0.001154594,0.002055628,0.0005694167,0.0001417194,0.01704572,0.01698207,0.03224207,0.2844491,0.336208,0.3074273],"study_design_scores_gemma":[0.0003448547,0.0001005982,0.00000729615,0.00004521976,0.000007712775,0.000008898868,0.00006967812,0.9872068,0.007142819,0.002672749,0.00212113,0.0002723126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002255332,0.0002214277,0.9940175,0.000397779,0.0001836929,0.0006787538,0.00001877249,0.001066111,0.001160562],"genre_scores_gemma":[0.2259863,0.00001686777,0.7727197,0.0003230097,0.00003804018,0.00009250379,0.00001277267,0.00002047324,0.0007903445],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9702247,"threshold_uncertainty_score":0.7812285,"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."}}