{"id":"W4391580154","doi":"10.54254/2755-2721/36/20230442","title":"A parallel Breadth-First Search using shared memory level-synchronization","year":2024,"lang":"en","type":"article","venue":"Applied and Computational Engineering","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Speedup; Graph traversal; Parallel computing; Graph; Tree traversal; Benchmark (surveying); Overhead (engineering); Multiprocessing; Distributed memory; Relation (database); Breadth-first search; Distributed computing; Shared memory; Theoretical computer science; Algorithm; Data mining","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.0001388664,0.0001168709,0.0000916983,0.0001495339,0.0001215386,0.0002713015,0.00016666,0.00003664317,0.000007973347],"category_scores_gemma":[0.000002795543,0.0001207499,0.00002807856,0.0003784824,0.00001926024,0.0002558743,0.00009437359,0.0001079315,0.0000146898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002973509,"about_ca_system_score_gemma":0.00004551321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004764064,"about_ca_topic_score_gemma":2.374998e-7,"domain_scores_codex":[0.9992323,0.000006713844,0.0001266073,0.0002794411,0.0001815891,0.0001733826],"domain_scores_gemma":[0.9996928,0.0001130363,0.0000111201,0.00009097954,0.00002747879,0.00006456562],"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.000001020573,0.000005753177,0.000003035426,0.00004951889,0.00001681723,0.000007722769,0.0004063266,0.6923495,0.0001750905,0.2957505,0.000009355083,0.01122535],"study_design_scores_gemma":[0.0001398294,0.000007734996,0.0005209229,0.00004776353,0.00000449515,0.00004448785,0.00001670915,0.9870391,0.00006218443,0.01185571,0.0001163176,0.0001447653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01129468,0.0003558158,0.9875238,0.0001213508,0.0001662829,0.00009205811,0.00000550202,0.0002676254,0.0001729045],"genre_scores_gemma":[0.8389454,0.000004398026,0.1608798,0.00003670338,0.00008001351,0.000009759809,0.00001409225,0.00001207181,0.00001772308],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8276507,"threshold_uncertainty_score":0.4924038,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0197935384951161,"score_gpt":0.2238018173652416,"score_spread":0.2040082788701255,"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."}}