{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004831241,0.000464967,0.0005906902,0.0008005568,0.0007542152,0.0009049213,0.001473081,0.0007463052,0.003844947],"category_scores_gemma":[0.001545978,0.0003334288,0.0005187525,0.00127841,0.0005578905,0.001255316,0.001149458,0.0005357152,0.000759991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008482323,"about_ca_system_score_gemma":0.00228353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005544346,"about_ca_topic_score_gemma":0.009625025,"domain_scores_codex":[0.9996386,0.00007258064,0.00002160239,0.00008935032,0.0001176261,0.00006029117],"domain_scores_gemma":[0.9994876,0.0002168184,0.00004462841,0.0001071182,0.0001072665,0.00003648573],"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.0005072377,0.0002676568,0.003044383,0.0005171094,0.0001403598,0.0003497306,0.0004427846,0.5842451,0.0401247,0.07250395,0.01107048,0.2867865],"study_design_scores_gemma":[0.00008650407,0.0001197111,0.0002536149,0.00001878627,0.00002124425,0.0001041157,0.00005843275,0.9684839,0.005939957,0.02038799,0.004510991,0.00001474238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04371993,0.0004109688,0.9471008,0.0003006723,0.00005099308,0.0001189234,0.0002044043,0.00167642,0.006416914],"genre_scores_gemma":[0.2857211,0.0002216233,0.7089827,0.0001176074,0.00002263159,0.0001717274,0.0003463822,0.0002325879,0.0041837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005544346,"threshold_uncertainty_score":0.01286262,"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."}}