{"id":"W4206914568","doi":"10.1109/hipc53243.2021.00035","title":"Multi-Stage Memory Efficient Strassen's Matrix Multiplication on GPU","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Strassen algorithm; Computer science; Parallel computing; Matrix multiplication; Memory footprint; Recursion (computer science); Overhead (engineering); Algorithm; Operating system","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.0002059139,0.0001205353,0.0001130289,0.00008679009,0.0001270683,0.0001497432,0.0004446062,0.00006146733,0.00003637051],"category_scores_gemma":[0.00006390402,0.0001121504,0.00006102281,0.0003576744,0.00001684087,0.00008340233,0.0001821641,0.0001103372,0.0001220815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004362211,"about_ca_system_score_gemma":0.00006745156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001253166,"about_ca_topic_score_gemma":0.000002917002,"domain_scores_codex":[0.9988434,0.00008049925,0.0002034515,0.0004506367,0.000225409,0.0001965438],"domain_scores_gemma":[0.9989199,0.00008904117,0.00007419453,0.0006869157,0.0001539499,0.0000760144],"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.000007446728,0.0009757203,0.000198878,0.00003235827,0.00002391675,0.00006283743,0.0005700019,0.8755745,0.01461895,0.07389038,0.004420365,0.02962467],"study_design_scores_gemma":[0.0002577022,0.00002363928,0.001188426,0.00001154026,0.000001351009,0.000005153733,0.00002400963,0.9204656,0.07665935,0.0000414952,0.001174849,0.0001469013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006001052,0.0000491577,0.9862893,0.0007471117,0.0001462609,0.0001355476,0.000001523483,0.001017816,0.005612265],"genre_scores_gemma":[0.3887011,0.000009532902,0.6039735,0.0003518079,0.00002217008,0.000009764423,0.000006343395,0.000007177855,0.006918615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3827,"threshold_uncertainty_score":0.4573362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03319076307292275,"score_gpt":0.3153252440835118,"score_spread":0.282134481010589,"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."}}