{"id":"W2107744418","doi":"10.22215/etd/2011-09053","title":"Exploring the limits of GPUs with parallel graph algorithms","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Parallel computing; Graph; Parallel algorithm; CUDA; Graphics; Graph algorithms; Computation; General-purpose computing on graphics processing units; Theoretical computer science; Algorithm; Computer graphics (images)","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.003324448,0.001161476,0.00132539,0.001393277,0.001165506,0.006329369,0.003228819,0.002332781,0.01553296],"category_scores_gemma":[0.03003666,0.001024315,0.0008424264,0.002273573,0.002167154,0.01016483,0.004038367,0.003099625,0.002304556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002188656,"about_ca_system_score_gemma":0.002085896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007508826,"about_ca_topic_score_gemma":0.00870621,"domain_scores_codex":[0.996487,0.001546229,0.0001084589,0.0004439398,0.0009897704,0.0004245707],"domain_scores_gemma":[0.9816703,0.01320455,0.0004299072,0.00261203,0.001323626,0.0007595629],"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.001502458,0.0005705383,0.008438503,0.0007399013,0.0002325383,0.0002909701,0.0006999234,0.2278515,0.006104285,0.5055296,0.04010134,0.2079385],"study_design_scores_gemma":[0.0001211122,0.0001253306,0.0006738638,0.0001142682,0.00005085043,0.0001014595,0.0001899695,0.6790228,0.001857297,0.2956506,0.02206985,0.00002261595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3774869,0.03283883,0.3630984,0.029721,0.001696675,0.0001942918,0.0008184644,0.004794524,0.1893509],"genre_scores_gemma":[0.8210087,0.005766202,0.1552211,0.001595277,0.0007772763,0.0001819563,0.0005015438,0.001155787,0.01379209],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01553296,"threshold_uncertainty_score":0.05196285,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1943321820974142,"score_gpt":0.2740735576048787,"score_spread":0.07974137550746452,"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."}}