{"id":"W2899399853","doi":"10.1109/cluster.2018.00029","title":"Scalable Shared-Memory Parallelization of the Block Recursive Inversion Algorithm","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Scalability; Parallel computing; Computer science; Block (permutation group theory); Shared memory; Inversion (geology); Inverse; Distributed memory; Parallel algorithm; Reduction (mathematics); Computational complexity theory; Execution time; Algorithm; Block size; Mathematics; Key (lock)","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.0001761816,0.00008160356,0.00009272331,0.00006448738,0.0001718505,0.00004558631,0.0008040526,0.0000578737,0.0000351179],"category_scores_gemma":[0.00004338842,0.00005745466,0.00004827377,0.000536866,0.00009082491,0.0002306739,0.0003620951,0.00005860732,0.00002955491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002395437,"about_ca_system_score_gemma":0.00005321024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003976301,"about_ca_topic_score_gemma":0.000003130956,"domain_scores_codex":[0.9991778,0.00006905634,0.0001790305,0.000220537,0.0002136798,0.000139876],"domain_scores_gemma":[0.9990251,0.00003012716,0.0001252698,0.0004864381,0.000296119,0.00003691972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000023111,0.0004386632,0.002569684,0.00005958733,0.0000796688,0.000003827793,0.005619386,0.01731942,0.001911749,0.07811212,0.6627356,0.2311271],"study_design_scores_gemma":[0.0001879846,0.0001019042,0.0005633382,0.00004775133,0.000003817453,0.000004914872,0.00002138682,0.9314781,0.0599376,0.00431148,0.003214668,0.0001269844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001353784,0.00002922898,0.9826741,0.0006579292,0.0002643657,0.0001428987,0.000001015572,0.0002512092,0.01462552],"genre_scores_gemma":[0.182607,0.00002517431,0.8129916,0.0008962174,0.00009974646,0.000005045571,0.000002916636,0.000008193107,0.003364116],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9141588,"threshold_uncertainty_score":0.2342933,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01229722274615713,"score_gpt":0.2393286985257406,"score_spread":0.2270314757795835,"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."}}