{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004198707,0.0003848469,0.0004552682,0.0002377703,0.0001748548,0.0001597449,0.003696343,0.0001016809,0.00002498646],"category_scores_gemma":[0.00001431625,0.0002307296,0.0002651304,0.0005415735,0.000292824,0.000379275,0.002116072,0.0007443376,0.00001374159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001631737,"about_ca_system_score_gemma":0.0001314568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005783087,"about_ca_topic_score_gemma":0.00008519652,"domain_scores_codex":[0.9977412,0.0001034146,0.0004248002,0.0007677884,0.0005547564,0.0004080078],"domain_scores_gemma":[0.9970679,0.0001648462,0.0002908064,0.002165587,0.0002022987,0.0001085401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003477248,0.0003407275,0.0003936003,0.0002051215,0.0004597983,0.00005319411,0.006057854,0.002167303,0.00001539958,0.771983,0.0005439798,0.2177452],"study_design_scores_gemma":[0.001366621,0.0009080069,0.02469972,0.001070763,0.0001778754,0.0001608426,0.0006013274,0.06493224,0.009168156,0.8910028,0.003326333,0.0025853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.010603,0.0003669492,0.9716113,0.0005987768,0.001639431,0.0004978942,0.000007869091,0.0003344905,0.01434028],"genre_scores_gemma":[0.2393131,0.0008747487,0.7583929,0.0002448178,0.0002342932,0.0003635509,0.000007362992,0.00004077358,0.0005283929],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2287101,"threshold_uncertainty_score":0.9408879,"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."}}