{"id":"https://openalex.org/W4285006655","doi":"https://doi.org/10.1145/3490148.3538552","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285006655","doi":"https://doi.org/10.1145/3490148.3538552"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538552","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538552","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538552","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538552","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028202081","display_name":"Hussam Al Daas","orcid":"https://orcid.org/0000-0001-9355-4042"},"institutions":[{"id":"https://openalex.org/I4210092957","display_name":"Research Complex at Harwell","ror":"https://ror.org/00gqx0331","country_code":"GB","type":"facility","lineage":["https://openalex.org/I4210092957"]},{"id":"https://openalex.org/I1286704778","display_name":"Rutherford Appleton Laboratory","ror":"https://ror.org/03gq8fr08","country_code":"GB","type":"facility","lineage":["https://openalex.org/I1286704778","https://openalex.org/I162524378","https://openalex.org/I4210087105"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Hussam Al Daas","raw_affiliation_strings":["Rutherford Appleton Laboratory, Didcot, Oxfordshire, United Kingdom","RAL - STFC Rutherford Appleton Laboratory (Harwell Campus, Didcot OX11 0FA - United Kingdom)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutherford Appleton Laboratory, Didcot, Oxfordshire, United Kingdom","institution_ids":["https://openalex.org/I1286704778"]},{"raw_affiliation_string":"RAL - STFC Rutherford Appleton Laboratory (Harwell Campus, Didcot OX11 0FA - United Kingdom)","institution_ids":["https://openalex.org/I4210092957","https://openalex.org/I1286704778"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064243391","display_name":"Grey Ballard","orcid":"https://orcid.org/0000-0003-1557-8027"},"institutions":[{"id":"https://openalex.org/I47251452","display_name":"Wake Forest University","ror":"https://ror.org/0207ad724","country_code":"US","type":"education","lineage":["https://openalex.org/I47251452"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Grey Ballard","raw_affiliation_strings":["Wake Forest University, Winston-Salem, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wake Forest University, Winston-Salem, NC, USA","institution_ids":["https://openalex.org/I47251452"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040521001","display_name":"Laura Grigori","orcid":"https://orcid.org/0000-0002-5880-1076"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Laura Grigori","raw_affiliation_strings":["Inria, Paris, France","ALPINES - Algorithms and parallel tools for integrated numerical simulations (48 Rue Barrault, 75013 Paris - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria, Paris, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"ALPINES - Algorithms and parallel tools for integrated numerical simulations (48 Rue Barrault, 75013 Paris - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103886654","display_name":"Suraj Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Suraj Kumar","raw_affiliation_strings":["Inria, Paris, France","ALPINES - Algorithms and parallel tools for integrated numerical simulations (48 Rue Barrault, 75013 Paris - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria, Paris, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"ALPINES - Algorithms and parallel tools for integrated numerical simulations (48 Rue Barrault, 75013 Paris - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102860683","display_name":"Kathryn Rouse","orcid":"https://orcid.org/0009-0001-4045-0423"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kathryn Rouse","raw_affiliation_strings":["Inmar Intelligence, Winston-Salem, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inmar Intelligence, Winston-Salem, NC, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5028202081"],"corresponding_institution_ids":["https://openalex.org/I1286704778","https://openalex.org/I4210092957"],"apc_list":null,"apc_paid":null,"fwci":0.7619,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74128045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"445","last_page":"448"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.7350571751594543},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7265703678131104},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.6839020848274231},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.586950421333313},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.5361051559448242},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.519490122795105},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45138153433799744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.342451274394989},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3272516131401062},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17908918857574463},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09005561470985413},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08102014660835266},{"id":"https://openalex.org/keywords/materials-science","display_name":"Materials science","score":0.0596291720867157}],"concepts":[{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.7350571751594543},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7265703678131104},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.6839020848274231},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.586950421333313},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.5361051559448242},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.519490122795105},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45138153433799744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.342451274394989},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3272516131401062},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17908918857574463},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09005561470985413},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08102014660835266},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0596291720867157},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3490148.3538552","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538552","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538552","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03950351v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03950351","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SPAA 2022 - 34th ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2022, Philadelphia PA, United States. ⟨10.1145/3490148.3538552⟩","raw_type":"Conference papers"},{"id":"pmh:oai:purl.org/net/epubs:work/54329975","is_oa":false,"landing_page_url":"http://purl.org/net/epubs/work/54329975","pdf_url":null,"source":{"id":"https://openalex.org/S4306400600","display_name":"ePubs (Science and Technology Facilities Council, Research Councils UK)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162524378","host_organization_name":"Science and Technology Facilities Council","host_organization_lineage":["https://openalex.org/I162524378"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1145/3490148.3538552","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538552","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538552","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G155429490","display_name":null,"funder_award_id":"CCF-1942892, OAC-2106920","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1620472780","display_name":null,"funder_award_id":"810367","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G3903888952","display_name":"Collaborative Research: OAC Core: Robust, Scalable, and Practical Low-Rank Approximation","funder_award_id":"2106920","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G422536779","display_name":null,"funder_award_id":"CCF-1942892","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4332098366","display_name":null,"funder_award_id":"1942892","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7683707404","display_name":null,"funder_award_id":"810367","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4285006655.pdf","grobid_xml":"https://content.openalex.org/works/W4285006655.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1972501001","https://openalex.org/W2010747199","https://openalex.org/W2065231486","https://openalex.org/W2090322880","https://openalex.org/W2131613942","https://openalex.org/W2164946224","https://openalex.org/W2168748809","https://openalex.org/W3002017272","https://openalex.org/W3041908836","https://openalex.org/W4250589301","https://openalex.org/W4281652902","https://openalex.org/W4302336677"],"related_works":["https://openalex.org/W3099313426","https://openalex.org/W4287593139","https://openalex.org/W752783541","https://openalex.org/W1506547947","https://openalex.org/W2995605830","https://openalex.org/W4206811032","https://openalex.org/W2086123442","https://openalex.org/W2596457687","https://openalex.org/W3212757063","https://openalex.org/W2158905189"],"abstract_inverted_index":{"Communication":[0],"lower":[1,39],"bounds":[2,40],"have":[3,17],"long":[4],"been":[5],"established":[6],"for":[7,44],"matrix":[8,46,67],"multiplication":[9],"algorithms.":[10],"However,":[11],"most":[12],"methods":[13],"of":[14,32,56,65,73],"asymptotic":[15],"analysis":[16],"either":[18],"ignored":[19],"constant":[20],"factors":[21],"or":[22],"not":[23],"obtained":[24],"the":[25,62,66,71],"tightest":[26],"possible":[27],"values.":[28],"The":[29],"main":[30],"result":[31],"this":[33],"work":[34,53],"is":[35],"establishing":[36],"memory-independent":[37],"communication":[38],"with":[41],"tight":[42],"constants":[43,49],"parallel":[45],"multiplication.":[47],"Our":[48],"improve":[50],"on":[51,61],"previous":[52],"in":[54],"each":[55],"three":[57],"cases":[58],"that":[59],"depend":[60],"relative":[63],"sizes":[64],"aspect":[68],"ratios":[69],"and":[70],"number":[72],"processors.":[74]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2}],"updated_date":"2026-05-02T08:42:23.175194","created_date":"2022-07-12T00:00:00"}