{"id":"W2320450249","doi":"10.2316/p.2010.676-037","title":"Low-Complex Task Scheduling Algorithms for Hierarchical Embedded Many-Core Architectures and Dynamic Applications","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Processor scheduling; Dynamic priority scheduling; Many core; Scheduling (production processes); Distributed computing; Multi-core processor; Fair-share scheduling; Task (project management); Algorithm; Computer network; Mathematical optimization; Resource (disambiguation)","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007610933,0.0005932378,0.0006601372,0.0004281519,0.0006295876,0.0007681037,0.001119573,0.0005602901,0.003528468],"category_scores_gemma":[0.003433469,0.0003274216,0.0003066243,0.0006475763,0.0004397696,0.000950331,0.0007917834,0.0009049351,0.0004896592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007231671,"about_ca_system_score_gemma":0.001559782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004525926,"about_ca_topic_score_gemma":0.01081018,"domain_scores_codex":[0.999772,0.00006777942,0.0000146431,0.00003511036,0.00007280087,0.0000376413],"domain_scores_gemma":[0.9990162,0.0005862305,0.00008747659,0.00009135708,0.0001564304,0.00006216367],"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.0001692192,0.00007907119,0.0003980766,0.00009090776,0.00002065882,0.00002874251,0.00007715006,0.9007294,0.003323814,0.01404674,0.002342555,0.07869364],"study_design_scores_gemma":[0.00001658537,0.00001358761,0.00004894588,0.000001647458,0.000002709034,0.000003626284,0.000008051257,0.9951498,0.0002778566,0.004198834,0.0002764183,0.000002073204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04989044,0.0004564015,0.9448183,0.0002737266,0.0001021174,0.00007291546,0.00005395541,0.0004241604,0.003907999],"genre_scores_gemma":[0.4977235,0.0003077401,0.4957212,0.0001435751,0.00008821698,0.0001855788,0.0001579131,0.0002392509,0.005433045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004525926,"threshold_uncertainty_score":0.01180393,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01415919459102929,"score_gpt":0.2812737539031707,"score_spread":0.2671145593121414,"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."}}