{"id":"https://openalex.org/W2990023472","doi":"https://doi.org/10.1109/hpec.2019.8916413","title":"Efficient implementation of sparse matrix-sparse vector multiplication for large scale graph analytics","display_name":"Efficient implementation of sparse matrix-sparse vector multiplication for large scale graph analytics","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2990023472","doi":"https://doi.org/10.1109/hpec.2019.8916413","mag":"2990023472"},"language":"en","primary_location":{"id":"doi:10.1109/hpec.2019.8916413","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2019.8916413","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/A5042998510","display_name":"Maur\u00edcio Serrano","orcid":"https://orcid.org/0000-0003-0250-5881"},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mauricio J. Serrano","raw_affiliation_strings":["IBM Thomas J. Watson Research Center Yorktown Heights, NY"],"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center Yorktown Heights, NY","institution_ids":["https://openalex.org/I4210114115"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042998510"],"corresponding_institution_ids":["https://openalex.org/I4210114115"],"apc_list":null,"apc_paid":null,"fwci":0.1768,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.55778683,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"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/T11478","display_name":"Caching and Content Delivery","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9994000196456909,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8435271382331848},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.6860558390617371},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6383644342422485},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5458195805549622},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.45860299468040466},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38835227489471436}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8435271382331848},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.6860558390617371},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6383644342422485},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5458195805549622},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.45860299468040466},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38835227489471436},{"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/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","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/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec.2019.8916413","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2019.8916413","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":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W26556108","https://openalex.org/W1557692423","https://openalex.org/W1783256592","https://openalex.org/W2007259720","https://openalex.org/W2068015060","https://openalex.org/W2101196063","https://openalex.org/W2126004407","https://openalex.org/W2134237243","https://openalex.org/W2415007423","https://openalex.org/W2479693678","https://openalex.org/W2542072367","https://openalex.org/W6655932363","https://openalex.org/W6716092662"],"related_works":["https://openalex.org/W1925544630","https://openalex.org/W2293771254","https://openalex.org/W2004686618","https://openalex.org/W3202552726","https://openalex.org/W3121828480","https://openalex.org/W2039875226","https://openalex.org/W4221142455","https://openalex.org/W2032786851","https://openalex.org/W2914631005","https://openalex.org/W2279642117"],"abstract_inverted_index":{"We":[0,215],"developed":[1],"a":[2,53,87,125,129,133,212],"parallel":[3,83],"algorithm":[4,42,111,122,159,218],"to":[5,60,73,97,100,155,183,210],"improve":[6],"the":[7,45,50,102,106,137,147,157,164,170,173,185,195,201],"cache":[8],"behavior":[9],"and":[10,36,56,77,91,132,224],"overall":[11],"performance":[12],"for":[13,82,118,160,222],"multiplication":[14,51],"of":[15,48,89,166,175,203],"sparse":[16,19],"matrices":[17],"with":[18,94,219],"vectors":[20],"(SpMSpV),":[21],"an":[22,57],"operation":[23,186],"used":[24],"increasingly":[25],"in":[26,33,67,115,169],"large":[27,237],"graph":[28],"analytics,":[29],"particularly":[30],"dynamic":[31,75],"graphs":[32,76,238],"social":[34],"networks":[35],"homeland":[37],"security":[38],"applications.":[39],"The":[40,109,121],"proposed":[41],"builds":[43],"upon":[44],"two-phase":[46],"approach":[47],"partitioning":[49],"into":[52],"scaling":[54],"phase":[55,69],"aggregation":[58],"phase,":[59],"achieve":[61,78],"more":[62],"cache-friendly":[63],"access":[64,96],"patterns":[65],"individually":[66],"each":[68,119],"[6],":[70],"[3].":[71],"However,":[72],"handle":[74],"better":[79,182],"load":[80],"balancing":[81],"implementation,":[84],"we":[85,152],"use":[86,211],"combination":[88],"private":[90,116,130,138],"shared":[92,98,134,148],"bins,":[93],"synchronized":[95],"bins":[99,117],"exchange":[101],"product":[103,113],"terms":[104,114],"between":[105,128],"two":[107],"phases.":[108],"new":[110],"accumulates":[112],"thread.":[120],"then":[123],"performs":[124],"bulk":[126],"transfer":[127],"bin":[131,139],"bin,":[135],"when":[136,236],"becomes":[140],"full.":[141],"Then":[142],"results":[143],"are":[144,239],"aggregated":[145],"from":[146],"bins.":[149],"In":[150],"addition,":[151],"employ":[153],"heuristics":[154],"decide":[156],"best":[158],"SpMSpV":[161],"based":[162],"on":[163],"number":[165,174,202],"nonzeros":[167,176,204],"involved":[168],"operation.":[171],"When":[172],"is":[177,205,208,231],"large,":[178],"it":[179,207],"may":[180],"be":[181],"perform":[184],"as":[187],"SpMV":[188],"(sparse":[189],"matrix":[190],"times":[191,235],"dense":[192],"vector)":[193],"despite":[194],"added":[196],"conversion":[197],"cost.":[198],"Also,":[199],"if":[200],"low":[206],"advantageous":[209],"simplified":[213],"algorithm.":[214],"compared":[216],"our":[217,225],"existing":[220],"algorithms":[221],"SpMSpV,":[223],"evaluation":[226],"shows":[227],"that":[228],"execution":[229],"time":[230],"reduced":[232],"by":[233],"several":[234],"considered.":[240]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
