{"id":"W1443472105","doi":"10.1007/978-3-642-37658-0_13","title":"A Fast Parallel Graph Partitioner for Shared-Memory Inspector/Executor Strategies","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Executor; Computer science; Parallel computing; Metis; Computation; Graph partition; Graph; Multi-core processor; Scheduling (production processes); Cluster analysis; Locality; Shared memory; Theoretical computer science; Algorithm; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005946406,0.0006856272,0.0006486597,0.0009496954,0.0004567594,0.001700015,0.003408444,0.0004115432,0.00006747434],"category_scores_gemma":[0.00006539044,0.0006329314,0.0002513865,0.0005921722,0.0006341292,0.001378756,0.0008847695,0.0006172072,0.00007224567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002146705,"about_ca_system_score_gemma":0.0006867975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003244907,"about_ca_topic_score_gemma":0.00003383757,"domain_scores_codex":[0.9958726,0.00003986823,0.0007052315,0.001748091,0.0007886192,0.0008456364],"domain_scores_gemma":[0.9969931,0.0003748027,0.0004293371,0.001429437,0.0005465127,0.0002268493],"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.00001546497,0.00009772943,0.00001707993,0.0001411386,0.00004260024,0.00003838571,0.001404924,0.5308472,0.0001025802,0.1947599,0.003404357,0.2691287],"study_design_scores_gemma":[0.0003512237,0.0002398557,0.00005684119,0.0003121451,0.000008567037,0.00002954318,5.921302e-7,0.6415672,0.0003893456,0.3539372,0.002226578,0.0008808417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001715989,0.0004998921,0.9890095,0.0006896509,0.00110596,0.0009838874,0.00001711116,0.0008562577,0.006820567],"genre_scores_gemma":[0.01669448,0.00008604414,0.9798646,0.001306989,0.0005477588,0.0001381205,0.00003175126,0.00005678624,0.001273446],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2682478,"threshold_uncertainty_score":0.9996122,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01873444956524676,"score_gpt":0.2530993612407089,"score_spread":0.2343649116754622,"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."}}