{"id":"W2460261552","doi":"","title":"Resource allocation and scheduling strategies using utility and the knapsack problem on computational grids","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Knapsack problem; Computer science; Grid; Heuristics; Grid computing; Distributed computing; Scheduling (production processes); Scalability; Resource allocation; Software deployment; Mathematical optimization; Computer network; Algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.0005945745,0.0002749813,0.0003152171,0.00009483852,0.0005329297,0.0006831856,0.0004017367,0.0001702331,0.000002225898],"category_scores_gemma":[0.00002771163,0.000197819,0.00005710722,0.000234763,0.0001247007,0.0002508009,0.00007532795,0.0003052152,0.00000374071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002775352,"about_ca_system_score_gemma":0.0002472102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001634901,"about_ca_topic_score_gemma":0.00002595615,"domain_scores_codex":[0.9981585,0.0002306387,0.0004144587,0.0005695295,0.0004102266,0.0002166504],"domain_scores_gemma":[0.9988385,0.0003375658,0.0002818474,0.0003060431,0.0001705615,0.00006542812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000230084,0.0001028207,0.0002242863,0.0005890473,0.0001689363,0.00001028123,0.01042551,0.2851604,0.00002913267,0.6879733,0.001015935,0.01407029],"study_design_scores_gemma":[0.0007562033,0.00004668274,0.002667061,0.0002799375,0.00001859331,0.00005727084,0.001135415,0.9829707,0.00001207965,0.01080726,0.0009513063,0.0002974572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3294682,0.001276072,0.6395276,0.0005934474,0.0004609011,0.0009797445,0.00001105238,0.0003056178,0.02737739],"genre_scores_gemma":[0.9789748,0.00002936865,0.02003019,0.0000923441,0.00009962414,0.00001050918,0.0002842513,0.00001315375,0.0004658085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6978104,"threshold_uncertainty_score":0.8066823,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02466393665536309,"score_gpt":0.26919438395518,"score_spread":0.2445304472998169,"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."}}