{"id":"https://openalex.org/W4415250929","doi":"https://doi.org/10.1109/hpec67600.2025.11196484","title":"When Structure is Silent: Opportunities for Algorithmic Dispatch in Linear Algebra","display_name":"When Structure is Silent: Opportunities for Algorithmic Dispatch in Linear Algebra","publication_year":2025,"publication_date":"2025-09-15","ids":{"openalex":"https://openalex.org/W4415250929","doi":"https://doi.org/10.1109/hpec67600.2025.11196484"},"language":"en","primary_location":{"id":"doi:10.1109/hpec67600.2025.11196484","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120024891","display_name":"Emmanuel Lujan","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Emmanuel Lujan","raw_affiliation_strings":["Massachusetts Institute of Technology,Computer Science & Artificial Intelligence Laboratory,Cambridge,Massachusetts,USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology,Computer Science & Artificial Intelligence Laboratory,Cambridge,Massachusetts,USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029673947","display_name":"Alan Edelman","orcid":"https://orcid.org/0000-0001-7676-3133"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Edelman","raw_affiliation_strings":["Massachusetts Institute of Technology,Computer Science & Artificial Intelligence Laboratory,Cambridge,Massachusetts,USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology,Computer Science & Artificial Intelligence Laboratory,Cambridge,Massachusetts,USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5120024891"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.41021605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9455000162124634,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9455000162124634,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.7455999851226807},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.53329998254776},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.39809998869895935},{"id":"https://openalex.org/keywords/economic-dispatch","display_name":"Economic dispatch","score":0.3882000148296356},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3617999851703644},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.3605000078678131},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3343000113964081},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.3012000024318695}],"concepts":[{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.7455999851226807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7253000140190125},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.53329998254776},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47909998893737793},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.39809998869895935},{"id":"https://openalex.org/C187633118","wikidata":"https://www.wikidata.org/wiki/Q1317949","display_name":"Economic dispatch","level":4,"score":0.3882000148296356},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37389999628067017},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3617999851703644},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.26510000228881836},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.262800008058548},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.26019999384880066},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.25769999623298645},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2522999942302704},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec67600.2025.11196484","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332369","display_name":"National Nuclear Security Administration","ror":"https://ror.org/03sk1we31"},{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1987902628","https://openalex.org/W2000873501","https://openalex.org/W2082727440","https://openalex.org/W2118076222","https://openalex.org/W2120575449","https://openalex.org/W2963232822","https://openalex.org/W3035965352","https://openalex.org/W4229666556","https://openalex.org/W4281657881","https://openalex.org/W4302010773","https://openalex.org/W4312258136","https://openalex.org/W4318541582","https://openalex.org/W4385585490","https://openalex.org/W4409133358"],"related_works":[],"abstract_inverted_index":{"Algorithmic":[0],"dispatch":[1,50,95,116,182],"is":[2,30],"essential":[3],"for":[4,58,179],"performance":[5,170],"in":[6,13,64,89,110,153,168],"linear-algebra\u2013intensive":[7],"systems.":[8],"A":[9],"persistent":[10],"challenge":[11],"lies":[12],"the":[14,27,49,68,85,122,177],"treatment":[15],"of":[16,70,84,124],"structured":[17,29],"matrices.":[18],"Although":[19],"such":[20],"matrices":[21,151],"are":[22,60],"often":[23],"described":[24],"as":[25,33,38],"\"sparse,\"":[26],"term":[28],"more":[31,76,180],"precise,":[32],"it":[34],"highlights":[35],"exploitable":[36],"properties\u2014such":[37],"bandedness":[39],"or":[40],"triangularity\u2014whose":[41],"algorithmic":[42,78],"advantages":[43],"extend":[44],"beyond":[45],"sparsity":[46],"alone.":[47],"When":[48],"strategy":[51],"leaves":[52],"these":[53,72,139],"structures":[54,74],"unrecognized,":[55],"valuable":[56],"opportunities":[57],"optimization":[59],"lost.":[61],"Recent":[62],"advances":[63],"generative":[65],"AI":[66],"offer":[67],"promise":[69],"linking":[71],"silent":[73,188],"to":[75,149,184,192],"effective":[77],"and":[79,127,135,164,171,186],"architectural":[80],"choices,":[81],"supplying":[82],"much":[83],"missing":[86],"connective":[87],"tissue":[88],"computational":[90],"linear":[91,194],"algebra.":[92,195],"However,":[93],"AI-synthesized":[94],"strategies":[96,183],"also":[97],"raise":[98],"important":[99],"questions":[100],"about":[101],"their":[102,131],"theoretical":[103,162],"soundness.":[104],"This":[105],"work":[106],"introduces":[107],"analytical":[108],"criteria\u2014grounded":[109],"time-complexity":[111],"analysis\u2014to":[112],"determine":[113],"when":[114],"structure-aware":[115],"delivers":[117],"tangible":[118],"gains.":[119],"We":[120,137],"examine":[121],"overheads":[123],"structure":[125],"detection":[126],"data-format":[128],"conversion,":[129],"characterizing":[130],"impact":[132],"on":[133,145],"speedup":[134],"slowdown.":[136],"illustrate":[138],"concepts":[140],"through":[141],"a":[142,154],"case":[143],"study":[144],"LU":[146],"factorization":[147],"applied":[148],"banded":[150],"stored":[152],"dense":[155],"format,":[156],"demonstrating":[157],"results":[158],"that":[159],"align":[160],"with":[161],"bounds":[163],"reveal":[165],"substantial":[166],"gains":[167],"both":[169],"memory":[172],"usage.":[173],"These":[174],"analyses":[175],"underscore":[176],"need":[178],"intelligent":[181],"recognize":[185],"exploit":[187],"structures\u2014an":[189],"underused":[190],"path":[191],"high-performance":[193]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-16T00:00:00"}