{"id":"W3211249445","doi":"10.32920/ryerson.14657736.v1","title":"Cost minimization of algorithms for scheduling parallel, single-threaded, heterogeneous, speed-scalable processors","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Computer science; Scalability; Scheduling (production processes); Parallel computing; Speedup; Computation; Overhead (engineering); Dynamic voltage scaling; Distributed computing; Hardware architecture; Energy consumption; Software; Real-time computing; Algorithm; Mathematical optimization; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004770283,0.0004754629,0.0008516652,0.0001717643,0.0001376308,0.0007203094,0.001691342,0.0003933061,0.00001702378],"category_scores_gemma":[0.0001290699,0.0004770877,0.0003470095,0.0004544264,0.00005750127,0.0002413524,0.001139718,0.0002952723,0.000007329733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001080207,"about_ca_system_score_gemma":0.0004618019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008226093,"about_ca_topic_score_gemma":0.00001372255,"domain_scores_codex":[0.9965475,0.0001198046,0.001024022,0.001210293,0.000528141,0.0005702201],"domain_scores_gemma":[0.996857,0.000192678,0.0007758134,0.001088652,0.0009192825,0.0001665198],"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.00001697468,0.0003314344,0.0001626151,0.001311565,0.0001772059,0.00001236902,0.0007397417,0.9876392,0.000185314,0.001276609,0.0005741512,0.00757279],"study_design_scores_gemma":[0.0006033261,0.0001006323,0.00001684127,0.000723676,0.00003897491,0.00003896445,0.0001052195,0.9894704,0.005529981,0.000887882,0.001906322,0.0005778146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00774389,0.0009839378,0.9870667,0.0002627992,0.00155696,0.001299994,0.00006430245,0.0003344702,0.0006869842],"genre_scores_gemma":[0.4110684,0.00003862976,0.587087,0.0001209634,0.000276358,0.00009295626,0.000688764,0.00004345166,0.000583502],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4033245,"threshold_uncertainty_score":0.9997681,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08527697510575923,"score_gpt":0.3022237740894966,"score_spread":0.2169467989837374,"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."}}