{"id":"W2056816686","doi":"10.1145/2641483.2641530","title":"On the Dynamic Scheduling of Task Farm Patterns on a Heterogeneous CPU-GPGPU Environment","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scheduling (production processes); Parallel computing; Programmer; Dynamic priority scheduling; Fair-share scheduling; Fixed-priority pre-emptive scheduling; Distributed computing; General-purpose computing on graphics processing units; Multi-core processor; Gang scheduling; Two-level scheduling; Symmetric multiprocessor system; Rate-monotonic scheduling; Computer architecture; Embedded system; Graphics; Operating system; Schedule","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.0001843239,0.0001572423,0.0001662775,0.00004742803,0.0001555921,0.00003747766,0.0008262311,0.00004495739,0.0000280673],"category_scores_gemma":[0.00001134664,0.0001018671,0.0001035593,0.0000972741,0.00003963603,0.00002893116,0.0001569859,0.0001266206,0.0001806673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004889396,"about_ca_system_score_gemma":0.00001984125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004407943,"about_ca_topic_score_gemma":0.000004777861,"domain_scores_codex":[0.9986855,0.00009734128,0.0002589436,0.0003393378,0.0003692207,0.0002496453],"domain_scores_gemma":[0.9988968,0.0001869987,0.0001155509,0.0007292681,0.00001426005,0.00005709818],"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.00004640131,0.001091946,0.003407495,0.00006876079,0.0002142825,0.0002679611,0.003087791,0.8766667,0.002871251,0.09353196,0.0006914284,0.01805399],"study_design_scores_gemma":[0.0006819531,0.0009306013,0.005042827,0.0001861219,0.000008402511,0.0002158726,0.00005556827,0.9847584,0.003684128,0.001093216,0.002810646,0.0005323088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5671561,0.00002850492,0.4310528,0.0003017105,0.0001537754,0.0001271997,0.000007822638,0.00006296551,0.001109149],"genre_scores_gemma":[0.9983417,0.00001263481,0.0009547414,0.0003918755,0.0000234424,0.000008173698,0.000004759315,0.000008049442,0.0002545592],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4311857,"threshold_uncertainty_score":0.4154021,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01707399082752442,"score_gpt":0.2133235586323732,"score_spread":0.1962495678048487,"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."}}