{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006936398,0.001556137,0.001250056,0.001000592,0.0009224719,0.00131694,0.002518723,0.0009464587,0.02560993],"category_scores_gemma":[0.001795058,0.000957783,0.001054523,0.001392062,0.0004456885,0.002175314,0.001444001,0.001518946,0.007180317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009931428,"about_ca_system_score_gemma":0.001529155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003477616,"about_ca_topic_score_gemma":0.007724284,"domain_scores_codex":[0.9994622,0.0000803553,0.00004121012,0.0001390737,0.0001984864,0.00007863562],"domain_scores_gemma":[0.9992176,0.0003244227,0.00003912999,0.0002066266,0.0001629243,0.00004912454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001266457,0.0002672662,0.0005098858,0.0004239864,0.0001240589,0.0001611407,0.0002143869,0.04908172,0.04449918,0.02344683,0.05283749,0.8271676],"study_design_scores_gemma":[0.0005971827,0.000211911,0.0005627046,0.00006302469,0.0001126196,0.0002110961,0.00008428008,0.8499079,0.05240746,0.05444412,0.04131204,0.00008556723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01008717,0.0004100259,0.9452775,0.00015115,0.0001201292,0.0001721291,0.0005207876,0.03629309,0.006967971],"genre_scores_gemma":[0.06562087,0.0002026865,0.9159091,0.0001725643,0.00007052471,0.0002745839,0.001147774,0.004706389,0.0118956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02560993,"threshold_uncertainty_score":0.08567381,"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."}}