{"id":"https://openalex.org/W2990689488","doi":"https://doi.org/10.1109/hpec.2019.8916550","title":"Write Quick, Run Fast: Sparse Deep Neural Network in 20 Minutes of Development Time via SuiteSparse:GraphBLAS","display_name":"Write Quick, Run Fast: Sparse Deep Neural Network in 20 Minutes of Development Time via SuiteSparse:GraphBLAS","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2990689488","doi":"https://doi.org/10.1109/hpec.2019.8916550","mag":"2990689488"},"language":"en","primary_location":{"id":"doi:10.1109/hpec.2019.8916550","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2019.8916550","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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/A5069178025","display_name":"Timothy A. Davis","orcid":"https://orcid.org/0000-0001-7614-6899"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Timothy A. Davis","raw_affiliation_strings":["Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066885836","display_name":"Mohsen Mahmoudi Aznaveh","orcid":"https://orcid.org/0000-0003-4860-4762"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohsen Aznaveh","raw_affiliation_strings":["Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109451982","display_name":"Scott P. Kolodziej","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Scott Kolodziej","raw_affiliation_strings":["Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069178025"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":1.822,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.88834579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9972000122070312,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.8627784252166748},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.699642539024353},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5940490961074829},{"id":"https://openalex.org/keywords/ibm","display_name":"IBM","score":0.5286693572998047},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.502722978591919},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4578778147697449},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.4514424800872803},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.4412003755569458},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43123048543930054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32855573296546936},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.326632559299469},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2909161448478699},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16219693422317505}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8627784252166748},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.699642539024353},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5940490961074829},{"id":"https://openalex.org/C70388272","wikidata":"https://www.wikidata.org/wiki/Q5968558","display_name":"IBM","level":2,"score":0.5286693572998047},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.502722978591919},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4578778147697449},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.4514424800872803},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.4412003755569458},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43123048543930054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32855573296546936},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.326632559299469},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2909161448478699},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16219693422317505},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec.2019.8916550","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2019.8916550","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W26556108","https://openalex.org/W2089437293","https://openalex.org/W2113606819","https://openalex.org/W2119144962","https://openalex.org/W2134237243","https://openalex.org/W2619096655","https://openalex.org/W2625457103","https://openalex.org/W2785856116","https://openalex.org/W2903237845","https://openalex.org/W2963416938","https://openalex.org/W2963674932","https://openalex.org/W2964299589","https://openalex.org/W2965423625","https://openalex.org/W2973134322","https://openalex.org/W3100839241","https://openalex.org/W6676903177","https://openalex.org/W6677580257","https://openalex.org/W6738642365","https://openalex.org/W6747766405"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2027972911","https://openalex.org/W2157978810","https://openalex.org/W2597809628","https://openalex.org/W3046370962"],"abstract_inverted_index":{"SuiteSparse:GraphBLAS":[0,173],"is":[1,132],"a":[2,11,30,47,53,93,100,152,165,186,199],"full":[3,94],"implementation":[4],"of":[5,25,99,106,109,128,195],"the":[6,22,59,67,78,82,89,119,129,138,169,183,203],"GraphBLAS":[7,35,130],"standard,":[8],"which":[9,110],"provides":[10],"powerful":[12],"and":[13,70,84,115,162],"expressive":[14],"framework":[15],"for":[16,168],"creating":[17],"graph":[18],"algorithms":[19],"based":[20],"on":[21,29,151,157,164],"elegant":[23],"mathematics":[24],"sparse":[26],"matrix":[27],"operations":[28],"semiring.":[31],"Algorithms":[32],"written":[33],"in":[34,77,197,202],"achieve":[36],"high":[37],"performance":[38,127],"with":[39,88],"minimal":[40],"development":[41,187],"time.":[42],"Using":[43],"GraphBLAS,":[44,114],"it":[45,116,122],"took":[46,92,190],"mere":[48],"20":[49],"minutes":[50],"to":[51,75,113,134,148],"write":[52],"first-cut":[54],"computational":[55],"kernel":[56,97],"that":[57,80,189],"solves":[58],"Sparse":[60],"Deep":[61],"Neural":[62],"Network":[63],"Graph":[64],"Challenge.":[65],"Understanding":[66],"problem":[68],"description":[69],"file":[71],"format,":[72],"writing":[73],"code":[74],"read":[76],"files":[79],"define":[81],"problem,":[83],"comparing":[85],"our":[86],"results":[87],"reference":[90,140],"solution":[91,131],"day.":[95],"The":[96,125],"consists":[98],"single":[101],"for-loop":[102],"around":[103],"4":[104],"lines":[105],"code,":[107],"all":[108],"are":[111],"calls":[112],"worked":[117],"perfectly":[118],"first":[120],"time":[121],"was":[123,180],"compiled.":[124],"sequential":[126],"3x":[133],"5x":[135],"faster":[136],"than":[137],"MATLAB":[139],"implementation.":[141],"OpenMP":[142],"parallelism":[143],"gives":[144],"an":[145,158],"additional":[146],"10x":[147],"15x":[149],"speedup":[150],"20-core":[153],"Intel":[154],"processor,":[155],"17x":[156],"IBM":[159],"Power8":[160],"system,":[161,167],"20x":[163],"Power9":[166],"largest":[170],"problems.":[171],"Since":[172],"does":[174],"not":[175],"yet":[176],"employ":[177],"MPI,":[178],"this":[179],"added":[181],"at":[182],"application":[184],"level,":[185],"effort":[188],"one":[191],"week,":[192],"primarily":[193],"because":[194],"difficulties":[196],"resolving":[198],"load-balancing":[200],"issue":[201],"MPI-based":[204],"parallel":[205],"algorithm.":[206]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":9}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
