{"id":"https://openalex.org/W2976898154","doi":"https://doi.org/10.1109/isit.2019.8849306","title":"Rateless Codes for Distributed Computations with Sparse Compressed Matrices","display_name":"Rateless Codes for Distributed Computations with Sparse Compressed Matrices","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2976898154","doi":"https://doi.org/10.1109/isit.2019.8849306","mag":"2976898154"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","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/A5021638015","display_name":"Ankur Mallick","orcid":"https://orcid.org/0009-0009-7068-5627"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ankur Mallick","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067441201","display_name":"Gauri Joshi","orcid":"https://orcid.org/0000-0002-6372-9697"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gauri Joshi","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021638015"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.2972,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82635955,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2793","last_page":"2797"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983000159263611,"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/T11478","display_name":"Caching and Content Delivery","score":0.9969000220298767,"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.7142626643180847},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6558947563171387},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.6436130404472351},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.6262179613113403},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.5340425372123718},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.510698139667511},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5060288310050964},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4942486584186554},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48988789319992065},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4216155409812927},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37180352210998535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.190146803855896}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7142626643180847},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6558947563171387},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.6436130404472351},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.6262179613113403},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5340425372123718},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.510698139667511},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5060288310050964},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4942486584186554},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48988789319992065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4216155409812927},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37180352210998535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.190146803855896},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1982063824","https://openalex.org/W2035272642","https://openalex.org/W2035490465","https://openalex.org/W2087507944","https://openalex.org/W2088866486","https://openalex.org/W2103012681","https://openalex.org/W2173213060","https://openalex.org/W2189465200","https://openalex.org/W2268702383","https://openalex.org/W2296125569","https://openalex.org/W2296600582","https://openalex.org/W2556205507","https://openalex.org/W2559809597","https://openalex.org/W2741736887","https://openalex.org/W2787606899","https://openalex.org/W2798525132","https://openalex.org/W2804145494","https://openalex.org/W2963290814","https://openalex.org/W2963461717","https://openalex.org/W2976898154","https://openalex.org/W4229922087","https://openalex.org/W4247828381","https://openalex.org/W4301515685","https://openalex.org/W6687322159","https://openalex.org/W6693618039","https://openalex.org/W6730190955","https://openalex.org/W6742061381","https://openalex.org/W6747961934","https://openalex.org/W6750231036","https://openalex.org/W6751988408"],"related_works":["https://openalex.org/W2293771254","https://openalex.org/W3121828480","https://openalex.org/W2039875226","https://openalex.org/W4221142455","https://openalex.org/W2032786851","https://openalex.org/W2914631005","https://openalex.org/W2952630098","https://openalex.org/W3132517792","https://openalex.org/W4285148873","https://openalex.org/W2256267046"],"abstract_inverted_index":{"Unpredictable":[0],"slowdown":[1],"of":[2,37,56,67,103,114],"worker":[3,87],"nodes,":[4,88],"or":[5],"node":[6],"straggling,":[7],"is":[8,30,126],"a":[9,22,96,104],"major":[10],"bottleneck":[11],"when":[12],"performing":[13],"large":[14],"matrix":[15,69,106,116],"computations":[16],"such":[17],"as":[18],"matrix-vector":[19,164],"multiplication":[20,165],"in":[21,34,45,143],"distributed":[23],"fashion.":[24],"For":[25],"sparse":[26,105,141,163],"matrices,":[27],"the":[28,35,46,54,68],"problem":[29],"compounded":[31],"by":[32,86],"irregularities":[33],"distribution":[36],"non-zero":[38,115],"elements,":[39],"which":[40],"leads":[41],"to":[42,107,120,128,139],"an":[43],"imbalance":[44],"computation":[47],"load":[48],"at":[49],"different":[50],"nodes.":[51],"To":[52],"mitigate":[53],"effect":[55],"stragglers":[57],"we":[58],"use":[59],"rateless":[60,153],"codes":[61],"that":[62,109,111,136,150],"generate":[63],"redundant":[64],"linear":[65],"combinations":[66],"rows":[70,102],"(or":[71],"columns)":[72],"and":[73,89,147],"distribute":[74],"them":[75],"across":[76],"workers.":[77],"This":[78],"coding":[79,154],"scheme":[80,125],"utilizes":[81],"all":[82],"partial":[83],"work":[84,129],"done":[85],"eliminates":[90],"tail":[91],"latency.":[92],"We":[93],"also":[94],"propose":[95],"balanced":[97,152],"row-allocation":[98],"strategy":[99,155],"for":[100],"allocating":[101],"workers":[108],"ensures":[110],"equal":[112],"amount":[113],"entries":[117],"are":[118,137],"assigned":[119],"each":[121],"worker.":[122],"The":[123],"entire":[124],"designed":[127],"with":[130],"compressed,":[131],"memory-efficient":[132],"formats":[133],"like":[134],"CSR/CSC":[135],"used":[138],"store":[140],"matrices":[142],"practice.":[144],"Theoretical":[145],"analysis":[146],"simulations":[148],"show":[149],"our":[151],"achieves":[156],"significantly":[157],"lower":[158],"overall":[159],"latency":[160],"than":[161],"conventional":[162],"strategies.":[166]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}