{"id":"https://openalex.org/W4285100227","doi":"https://doi.org/10.1145/3539781.3539791","title":"Scalable low-rank factorization using a task-based runtime system with distributed memory","display_name":"Scalable low-rank factorization using a task-based runtime system with distributed memory","publication_year":2022,"publication_date":"2022-06-27","ids":{"openalex":"https://openalex.org/W4285100227","doi":"https://doi.org/10.1145/3539781.3539791"},"language":"en","primary_location":{"id":"doi:10.1145/3539781.3539791","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3539781.3539791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Platform for Advanced Scientific Computing Conference","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/A5090912313","display_name":"Abeynaya Gnanasekaran","orcid":"https://orcid.org/0000-0001-7088-9261"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Abeynaya Gnanasekaran","raw_affiliation_strings":["Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061822097","display_name":"Eric Darve","orcid":"https://orcid.org/0000-0002-1938-3836"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric Darve","raw_affiliation_strings":["Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090912313"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06266128,"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":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10739","display_name":"Electromagnetic Scattering and Analysis","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8430888652801514},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7302915453910828},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.713166356086731},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5696885585784912},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5238059759140015},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.49169355630874634},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4796098470687866},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4257078170776367},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4252700209617615},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3645451068878174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.227910578250885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07799041271209717}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8430888652801514},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7302915453910828},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.713166356086731},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5696885585784912},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5238059759140015},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.49169355630874634},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4796098470687866},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4257078170776367},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4252700209617615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3645451068878174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.227910578250885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07799041271209717},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3539781.3539791","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3539781.3539791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Platform for Advanced Scientific Computing Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G839232592","display_name":null,"funder_award_id":"80NSSC18M0152","funder_id":"https://openalex.org/F4320334116","funder_display_name":"NASA Headquarters"}],"funders":[{"id":"https://openalex.org/F4320334116","display_name":"NASA Headquarters","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1579967852","https://openalex.org/W1940191795","https://openalex.org/W1964681401","https://openalex.org/W1969923711","https://openalex.org/W1982811641","https://openalex.org/W2006554089","https://openalex.org/W2016279572","https://openalex.org/W2018419001","https://openalex.org/W2063298393","https://openalex.org/W2067183844","https://openalex.org/W2087440962","https://openalex.org/W2107599050","https://openalex.org/W2117756735","https://openalex.org/W2132820941","https://openalex.org/W2168612748","https://openalex.org/W2430123104","https://openalex.org/W2983126917","https://openalex.org/W3022111729","https://openalex.org/W3093305795","https://openalex.org/W3115255921","https://openalex.org/W3130355893","https://openalex.org/W3190462163","https://openalex.org/W3197960396"],"related_works":["https://openalex.org/W2186864281","https://openalex.org/W233983175","https://openalex.org/W1973739845","https://openalex.org/W119752240","https://openalex.org/W2355089277","https://openalex.org/W2312486021","https://openalex.org/W2898722594","https://openalex.org/W2113856999","https://openalex.org/W2125326641","https://openalex.org/W133838137"],"abstract_inverted_index":{"We":[0,30,45,115],"present":[1],"a":[2,12,23,40,105],"new":[3],"parallel":[4],"task-based":[5,26],"algorithm":[6,65],"for":[7,109],"randomized":[8,34,64],"low-rank":[9,101],"factorizations":[10],"of":[11,122],"matrix":[13],"and":[14,59,80,120],"its":[15],"application":[16],"to":[17,88],"fast":[18,106],"hierarchical":[19,107],"solvers.":[20],"TaskTorrent":[21,67],"is":[22],"lightweight,":[24],"distributed,":[25],"runtime":[27],"in":[28,43,50,60,66,118],"C++.":[29],"explain":[31],"how":[32],"the":[33,47,51,69,123],"factorization":[35,52,102],"can":[36],"be":[37],"expressed":[38],"as":[39],"task":[41],"graph":[42],"TaskTorrent.":[44],"compare":[46],"key":[48],"steps":[49],"with":[53,93],"similar":[54],"implementations":[55],"using":[56],"StarPU,":[57],"PaRSEC,":[58],"ScaLAPACK.":[61],"The":[62,78],"overall":[63],"outperforms":[68],"column":[70],"pivoted":[71],"QR":[72],"routine":[73],"from":[74],"ScaLAPACK":[75],"by":[76],"far.":[77],"weak":[79],"strong":[81],"scaling":[82],"experiments":[83],"demonstrate":[84,116],"excellent":[85],"scalability":[86,121],"up":[87],"our":[89,99],"largest":[90],"available":[91],"configuration":[92],"1,024":[94],"cores.":[95],"Finally,":[96],"we":[97],"incorporate":[98],"distributed":[100],"into":[103],"spaND,":[104],"solver":[108],"solving":[110],"large":[111],"sparse":[112],"linear":[113],"systems.":[114],"gains":[117],"performance":[119],"spaND":[124],"solver.":[125]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}