{"id":"https://openalex.org/W2742439621","doi":"https://doi.org/10.1109/isit.2017.8006962","title":"Coded computation for multicore setups","display_name":"Coded computation for multicore setups","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2742439621","doi":"https://doi.org/10.1109/isit.2017.8006962","mag":"2742439621"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006962","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006962","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5101899300","display_name":"Kangwook Lee","orcid":"https://orcid.org/0000-0002-3360-9678"},"institutions":[{"id":"https://openalex.org/I4210099236","display_name":"Kootenay Association for Science & Technology","ror":"https://ror.org/011pv9p44","country_code":"CA","type":"nonprofit","lineage":["https://openalex.org/I4210099236"]},{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["CA","KR"],"is_corresponding":true,"raw_author_name":"Kangwook Lee","raw_affiliation_strings":["KAIST"],"affiliations":[{"raw_affiliation_string":"KAIST","institution_ids":["https://openalex.org/I4210099236","https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040270189","display_name":"Ramtin Pedarsani","orcid":"https://orcid.org/0000-0002-1126-0292"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramtin Pedarsani","raw_affiliation_strings":["UC Santa Barbara"],"affiliations":[{"raw_affiliation_string":"UC Santa Barbara","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018630988","display_name":"Dimitris Papailiopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dimitris Papailiopoulos","raw_affiliation_strings":["UW-Madison"],"affiliations":[{"raw_affiliation_string":"UW-Madison","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030620564","display_name":"Kannan Ramchandran","orcid":"https://orcid.org/0000-0002-4567-328X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]},{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kannan Ramchandran","raw_affiliation_strings":["UC Berkeley"],"affiliations":[{"raw_affiliation_string":"UC Berkeley","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101899300"],"corresponding_institution_ids":["https://openalex.org/I157485424","https://openalex.org/I4210099236"],"apc_list":null,"apc_paid":null,"fwci":4.8755,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.9609013,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2413","last_page":"2417"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994999766349792,"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.9994999766349792,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9988999962806702,"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/computation","display_name":"Computation","score":0.6265986561775208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.606298565864563},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5272811055183411},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.525711715221405},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4791542887687683},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44996708631515503},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.4335256516933441},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.4220700263977051},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4195857048034668},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3665219843387604},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.29674839973449707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2436656653881073},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08999103307723999}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6265986561775208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.606298565864563},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5272811055183411},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.525711715221405},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4791542887687683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44996708631515503},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.4335256516933441},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.4220700263977051},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4195857048034668},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3665219843387604},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.29674839973449707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2436656653881073},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08999103307723999},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8006962","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006962","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1661486706","https://openalex.org/W1861377444","https://openalex.org/W1903497807","https://openalex.org/W1982063824","https://openalex.org/W1983964956","https://openalex.org/W2101124960","https://openalex.org/W2110104287","https://openalex.org/W2268702383","https://openalex.org/W2336650964","https://openalex.org/W2546994163","https://openalex.org/W2556205507","https://openalex.org/W2582482048","https://openalex.org/W2963290814","https://openalex.org/W2963541360","https://openalex.org/W2964088343","https://openalex.org/W4236536374","https://openalex.org/W4298838919","https://openalex.org/W4301515685","https://openalex.org/W6639193275","https://openalex.org/W6639528875","https://openalex.org/W6676421412","https://openalex.org/W6688784307","https://openalex.org/W6693618039","https://openalex.org/W6703420464","https://openalex.org/W6730190955","https://openalex.org/W6779799172"],"related_works":["https://openalex.org/W2128523353","https://openalex.org/W2291648581","https://openalex.org/W2107644726","https://openalex.org/W2406856881","https://openalex.org/W2011868109","https://openalex.org/W3041000698","https://openalex.org/W2528998362","https://openalex.org/W2112835356","https://openalex.org/W2029959048","https://openalex.org/W2129895572"],"abstract_inverted_index":{"Consider":[0],"a":[1,7,20],"distributed":[2,77,85,109],"computing":[3,65,86],"setup":[4],"consisting":[5],"of":[6,46,87,111,124,163],"master":[8],"node":[9],"and":[10,19,146],"n":[11],"worker":[12,52],"nodes,":[13],"each":[14,37],"equipped":[15],"with":[16],"p":[17],"cores,":[18],"function":[21],"f":[22,30,38],"(x)":[23],"=":[24],"g(f":[25],"<sub":[26,31,39],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[27,32,40],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[28],"(x),":[29],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[33],"(x),...,":[34],"fk(x)),":[35],"where":[36,160],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</sub>":[41],"can":[42,90,106],"be":[43,91],"computed":[44],"independently":[45],"the":[47,51,60,122,129,142,161],"rest.":[48],"Assuming":[49],"that":[50,84,136],"computational":[53],"times":[54,154],"have":[55],"exponential":[56],"tails,":[57],"what":[58],"is":[59,82,100,149,165],"minimum":[61],"possible":[62],"time":[63],"for":[64],"f?":[66],"Can":[67],"we":[68,120],"use":[69,123],"coding":[70,139],"theory":[71],"principles":[72],"to":[73],"speed":[74,107],"up":[75,108],"this":[76,118],"computation?":[78],"In":[79],"[1],":[80],"it":[81,99,148],"shown":[83],"linear":[88,95,104,126],"functions":[89,113],"expedited":[92],"by":[93],"applying":[94],"erasure":[96],"codes.":[97],"However,":[98],"not":[101],"clear":[102],"if":[103],"codes":[105],"computation":[110],"`nonlinear'":[112],"as":[114],"well.":[115],"To":[116],"resolve":[117],"problem,":[119],"propose":[121],"sparse":[125],"codes,":[127],"exploiting":[128],"modern":[130],"multicore":[131],"processing":[132],"architecture.":[133],"We":[134],"show":[135],"1)":[137],"our":[138],"solution":[140],"achieves":[141],"order":[143],"optimal":[144],"runtime,":[145],"2)":[147],"at":[150],"least":[151],"\u0398(\u221alog":[152],"n)":[153],"faster":[155],"than":[156],"any":[157],"uncoded":[158],"schemes":[159],"number":[162],"workers":[164],"n.":[166]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}