{"id":"https://openalex.org/W2912733095","doi":"https://doi.org/10.1109/allerton.2018.8636047","title":"Masterless Coded Computing: A Fully-Distributed Coded FFT Algorithm","display_name":"Masterless Coded Computing: A Fully-Distributed Coded FFT Algorithm","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2912733095","doi":"https://doi.org/10.1109/allerton.2018.8636047","mag":"2912733095"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2018.8636047","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8636047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5051646746","display_name":"Haewon Jeong","orcid":"https://orcid.org/0009-0008-3254-4834"},"institutions":[{"id":"https://openalex.org/I130442723","display_name":"Universidade Federal do Rio Grande do Sul","ror":"https://ror.org/041yk2d64","country_code":"BR","type":"education","lineage":["https://openalex.org/I130442723"]},{"id":"https://openalex.org/I94328231","display_name":"University of Rio Grande and Rio Grande Community College","ror":"https://ror.org/02sghbs34","country_code":"US","type":"education","lineage":["https://openalex.org/I94328231"]}],"countries":["BR","US"],"is_corresponding":true,"raw_author_name":"Haewon Jeong","raw_affiliation_strings":["Federal University of Rio Grande do Sul"],"affiliations":[{"raw_affiliation_string":"Federal University of Rio Grande do Sul","institution_ids":["https://openalex.org/I94328231","https://openalex.org/I130442723"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019607600","display_name":"Tze Meng Low","orcid":"https://orcid.org/0000-0002-5179-8249"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Tze Meng Low","raw_affiliation_strings":["University of Campinas"],"affiliations":[{"raw_affiliation_string":"University of Campinas","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054746425","display_name":"Pulkit Grover","orcid":"https://orcid.org/0000-0001-7651-7776"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pulkit Grover","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051646746"],"corresponding_institution_ids":["https://openalex.org/I130442723","https://openalex.org/I94328231"],"apc_list":null,"apc_paid":null,"fwci":2.2144,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.89380766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"887","last_page":"894"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998000264167786,"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.9998000264167786,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9987999796867371,"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.8218801021575928},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7287311553955078},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4277361035346985},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4239007234573364}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8218801021575928},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7287311553955078},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4277361035346985},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4239007234573364}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2018.8636047","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8636047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W1581232847","https://openalex.org/W1837653564","https://openalex.org/W1982169443","https://openalex.org/W1987221372","https://openalex.org/W1990523337","https://openalex.org/W1994148398","https://openalex.org/W1997044393","https://openalex.org/W2008976700","https://openalex.org/W2022619326","https://openalex.org/W2042478655","https://openalex.org/W2042544282","https://openalex.org/W2062810083","https://openalex.org/W2063924830","https://openalex.org/W2083613288","https://openalex.org/W2100944376","https://openalex.org/W2102182691","https://openalex.org/W2105185344","https://openalex.org/W2115647171","https://openalex.org/W2118832200","https://openalex.org/W2133557963","https://openalex.org/W2142812297","https://openalex.org/W2158612529","https://openalex.org/W2168260026","https://openalex.org/W2170796499","https://openalex.org/W2268702383","https://openalex.org/W2296125569","https://openalex.org/W2625724326","https://openalex.org/W2751625010","https://openalex.org/W2782716197","https://openalex.org/W2783927867","https://openalex.org/W2962850796","https://openalex.org/W2962957061","https://openalex.org/W2962962878","https://openalex.org/W2963019117","https://openalex.org/W2963041503","https://openalex.org/W2963231940","https://openalex.org/W2963585086","https://openalex.org/W2964095159","https://openalex.org/W2964120628","https://openalex.org/W3100004208","https://openalex.org/W3103425664","https://openalex.org/W4210992409","https://openalex.org/W6638708518","https://openalex.org/W6661267766","https://openalex.org/W6671166405","https://openalex.org/W6677199727","https://openalex.org/W6684712369","https://openalex.org/W6693618039","https://openalex.org/W6738835244","https://openalex.org/W6743684298","https://openalex.org/W6746933677","https://openalex.org/W6779799172"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W4327521644","https://openalex.org/W2978884468","https://openalex.org/W3132558499","https://openalex.org/W2390279801","https://openalex.org/W2168413811","https://openalex.org/W2005846134","https://openalex.org/W2358668433"],"abstract_inverted_index":{"We":[0,52,80],"propose":[1],"a":[2,14,22,34,85],"coded":[3,61],"computing":[4,74],"strategy":[5],"for":[6],"the":[7,47,60,65,91,101,106],"Fast":[8],"Fourier":[9],"Transform":[10],"(FFT)":[11],"algorithm":[12,63],"in":[13,49,72,98,105],"fully":[15,30],"distributed":[16,31],"setting,":[17],"which":[18,68],"does":[19],"not":[20],"have":[21],"powerful":[23],"master":[24],"node":[25],"orchestrating":[26],"worker":[27],"nodes.":[28],"The":[29],"setting":[32],"requires":[33],"large":[35],"amount":[36],"of":[37,56,59,94],"data":[38],"movements":[39],"between":[40],"nodes,":[41],"and":[42],"this":[43],"communication":[44,54,78,92,102],"is":[45,69,96],"often":[46],"bottleneck":[48],"parallel":[50],"computing.":[51],"identify":[53],"cost":[55],"each":[57],"step":[58],"FFT":[62,108],"using":[64,84],"\u03b1-\u03b2":[66],"model,":[67],"commonly":[70],"used":[71],"highperformance":[73],"literature":[75],"to":[76,100],"estimate":[77],"latency.":[79],"show":[81],"that":[82],"by":[83],"(P,":[86],"K)":[87],"systematic":[88],"MDS":[89],"code,":[90],"overhead":[93],"coding":[95],"negligible":[97],"comparison":[99],"costs":[103],"inherent":[104],"uncoded":[107],"implementation":[109],"if":[110],"P":[111],"-":[112],"K":[113],"=":[114],"o(log":[115],"K).":[116]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}