{"id":"W2543444511","doi":"10.1109/icm.2010.5696192","title":"An efficient scheduling methodology for heterogeneous multi-core processor systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Scheduling (production processes); Directed acyclic graph; Multiprocessing; Schedule; Distributed computing; Greedy algorithm; Parallel computing; Multiprocessor scheduling; Heuristic; Processor scheduling; Dynamic priority scheduling; Multi-core processor; Symmetric multiprocessor system; Two-level scheduling; Mathematical optimization; Algorithm; Operating system; Artificial intelligence","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.0009428369,0.0005649942,0.0003680659,0.000633509,0.0005997645,0.0006379456,0.0009798724,0.0003981453,0.001567063],"category_scores_gemma":[0.001055686,0.0004096692,0.0005888254,0.0006734122,0.0004616439,0.0008908208,0.0006710315,0.0005965306,0.0004704713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005004995,"about_ca_system_score_gemma":0.001171277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008375436,"about_ca_topic_score_gemma":0.001570114,"domain_scores_codex":[0.999377,0.0002002719,0.00004552529,0.00007645698,0.000250842,0.00004994047],"domain_scores_gemma":[0.9996756,0.0000982101,0.000039004,0.00008043472,0.00008409004,0.00002260647],"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.00006828855,0.0001108337,0.0004468343,0.0004770049,0.0001042312,0.0003794045,0.0002067335,0.4416894,0.07259883,0.1778351,0.004496243,0.3015871],"study_design_scores_gemma":[0.00005245551,0.0001600481,0.0002386878,0.0000510408,0.00006158023,0.0002578491,0.0000598125,0.8703226,0.02439671,0.06113787,0.04323521,0.00002604528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002715799,0.0001708266,0.9956108,0.00005278342,0.00002941106,0.00006562415,0.00001558426,0.0001995395,0.001139695],"genre_scores_gemma":[0.07399924,0.0004431789,0.923168,0.00006404825,0.00004513919,0.0002045518,0.00008158349,0.0001137648,0.001880484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001567063,"threshold_uncertainty_score":0.005242348,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1098911703688039,"score_gpt":0.3564260492005476,"score_spread":0.2465348788317437,"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."}}