{"id":"https://openalex.org/W2891780733","doi":"https://doi.org/10.1109/itw.2018.8613321","title":"C<sup>3</sup>LES: Codes for Coded Computation that Leverage Stragglers","display_name":"C<sup>3</sup>LES: Codes for Coded Computation that Leverage Stragglers","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2891780733","doi":"https://doi.org/10.1109/itw.2018.8613321","mag":"2891780733"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2018.8613321","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2018.8613321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Information Theory Workshop (ITW)","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/A5029951257","display_name":"Anindya Bijoy Das","orcid":"https://orcid.org/0000-0002-3615-7400"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anindya B. Das","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, U.S.A","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074466108","display_name":"Li Tang","orcid":"https://orcid.org/0000-0003-0796-3160"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Li Tang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, U.S.A","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aditya Ramamoorthy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, U.S.A","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029951257"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":5.536,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.9628147,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9990000128746033,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9990000128746033,"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.9990000128746033,"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.9959999918937683,"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.7570785880088806},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6245636940002441},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5553671717643738},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4976966679096222},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.4677337110042572},{"id":"https://openalex.org/keywords/block-matrix","display_name":"Block matrix","score":0.4157191216945648},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4051269292831421},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37937232851982117},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33749282360076904},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2575857639312744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1214790940284729}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7570785880088806},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6245636940002441},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5553671717643738},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4976966679096222},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.4677337110042572},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.4157191216945648},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4051269292831421},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37937232851982117},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33749282360076904},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2575857639312744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1214790940284729},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2018.8613321","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2018.8613321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2268702383","https://openalex.org/W2556205507","https://openalex.org/W2741736887","https://openalex.org/W2787606899","https://openalex.org/W2798525132","https://openalex.org/W2962850796","https://openalex.org/W2963461717","https://openalex.org/W2964229375","https://openalex.org/W3100515187","https://openalex.org/W4297506785","https://openalex.org/W4301515685","https://openalex.org/W6730190955","https://openalex.org/W6738835244","https://openalex.org/W6742061381","https://openalex.org/W6747961934","https://openalex.org/W6750231036"],"related_works":["https://openalex.org/W580815825","https://openalex.org/W2163811767","https://openalex.org/W2061410220","https://openalex.org/W2498430702","https://openalex.org/W2787993192","https://openalex.org/W2964207886","https://openalex.org/W2014231868","https://openalex.org/W2158269427","https://openalex.org/W4381280689","https://openalex.org/W3033859939"],"abstract_inverted_index":{"In":[0,127],"distributed":[1],"computing":[2,112],"systems,":[3],"it":[4,104,120,153],"is":[5,57,101],"well":[6],"recognized":[7],"that":[8,11,135],"worker":[9],"nodes":[10],"are":[12,47,60],"slow":[13],"(called":[14],"stragglers)":[15],"tend":[16],"to":[17,31,143,156],"dominate":[18],"the":[19,33,92,113,137,145,162],"overall":[20],"job":[21],"execution":[22],"time.":[23],"Coded":[24],"computation":[25],"utilizes":[26],"concepts":[27],"from":[28],"erasure":[29],"coding":[30,141,148],"mitigate":[32],"effect":[34],"of":[35,41,89,91,139,147],"stragglers":[36],"by":[37,161],"running":[38],"\u201ccoded\u201d":[39],"copies":[40],"tasks":[42],"comprising":[43],"a":[44,68,132],"job.":[45],"Stragglers":[46],"typically":[48,84],"treated":[49],"as":[50,75,103],"erasures":[51],"in":[52,67,106,116,149],"this":[53,56,128,166],"process.":[54],"While":[55],"useful,":[58],"there":[59],"issues":[61],"with":[62,79],"applying,":[63],"e.g.,":[64],"MDS":[65,82],"codes":[66,83],"straightforward":[69],"manner.":[70],"Specifically,":[71],"several":[72,172],"applications":[73],"such":[74],"matrix-vector":[76,150],"products":[77,115],"deal":[78],"sparse":[80],"matrices.":[81],"require":[85],"dense":[86],"linear":[87],"combinations":[88],"submatrices":[90],"original":[93],"matrix":[94],"which":[95],"destroy":[96],"their":[97,177],"inherent":[98],"sparsity.":[99],"This":[100],"problematic":[102],"results":[105],"significantly":[107],"higher":[108],"processing":[109],"times":[110],"for":[111],"submatrix-vector":[114],"coded":[117],"computation.":[118,151],"Furthermore,":[119],"also":[121],"ignores":[122],"partial":[123,158],"computations":[124,159],"at":[125],"stragglers.":[126],"work,":[129],"we":[130,168],"propose":[131,169],"fine-grained":[133],"model":[134],"quantifies":[136],"level":[138],"non-trivial":[140],"needed":[142],"obtain":[144],"benefits":[146],"Simultaneously,":[152],"allows":[154],"us":[155],"leverage":[157],"performed":[160],"straggler":[163],"nodes.":[164],"For":[165],"model,":[167],"and":[170,175],"evaluate":[171],"code":[173],"designs":[174],"discuss":[176],"properties.":[178]},"counts_by_year":[{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
