A Distributed Low-Complexity Coding Solution for Large-Scale Distributed FFT
In distributed computing, a number of available helper nodes assist in completing a task for the master node. In such setups, the failure or straggling of even a single helper node can significantly increase the processing time. Therefore, coded distributed computing has been the subject of many rec...
Uložené v:
| Vydané v: | IEEE transactions on communications Ročník 68; číslo 11; s. 6617 - 6628 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
IEEE
01.11.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Predmet: | |
| ISSN: | 0090-6778, 1558-0857 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In distributed computing, a number of available helper nodes assist in completing a task for the master node. In such setups, the failure or straggling of even a single helper node can significantly increase the processing time. Therefore, coded distributed computing has been the subject of many recent studies. A problem that arises in some setups is that the master's decoding complexity may exceed the complexity of self-computation, rending distributed computing useless. One such case is distributed large-scale FFT, where many helper nodes are required. In this work, we propose a novel distributed coded FFT, where the master's load is significantly lower than the existing work. The gain is obtained by (1) using a novel distributed FFT structure which allows for reliable distributed coding at the Shuffle stage, and (2) using Raptor codes which enjoy a linear complexity at the cost of a small number of extra helper nodes. Numerical results are provided to support the benefits of our proposed solution and to optimize design parameters. |
|---|---|
| AbstractList | In distributed computing, a number of available helper nodes assist in completing a task for the master node. In such setups, the failure or straggling of even a single helper node can significantly increase the processing time. Therefore, coded distributed computing has been the subject of many recent studies. A problem that arises in some setups is that the master’s decoding complexity may exceed the complexity of self-computation, rending distributed computing useless. One such case is distributed large-scale FFT, where many helper nodes are required. In this work, we propose a novel distributed coded FFT, where the master’s load is significantly lower than the existing work. The gain is obtained by (1) using a novel distributed FFT structure which allows for reliable distributed coding at the Shuffle stage, and (2) using Raptor codes which enjoy a linear complexity at the cost of a small number of extra helper nodes. Numerical results are provided to support the benefits of our proposed solution and to optimize design parameters. |
| Author | Yazdanialahabadi, Arash Ardakani, Masoud |
| Author_xml | – sequence: 1 givenname: Arash orcidid: 0000-0003-4478-5973 surname: Yazdanialahabadi fullname: Yazdanialahabadi, Arash email: yazdania@ualberta.ca organization: Electrical and Computer Engineering Department, University of Alberta, Edmonton, AB, Canada – sequence: 2 givenname: Masoud orcidid: 0000-0002-5997-1093 surname: Ardakani fullname: Ardakani, Masoud email: ardakani@ualberta.ca organization: Electrical and Computer Engineering Department, University of Alberta, Edmonton, AB, Canada |
| BookMark | eNp9kE1PwkAQhjcGEwH9A3pp4rm4H92vI6miJiUcwPNmu92SJaWL2yXKv7cIMdGDh8lc5pl35hmBQetbC8AtghOEoHxY5Yv5fIIhhhMCEWOZuABDRKlIoaB8AIYQSpgyzsUVGHXdBkKYQUKGoJgmj66LwZX7aKuk8B9p7re7xn66eEhyX7l2nSx9s4_Ot0ntQ1LosLbp0ujG_kJns9U1uKx109mbcx-Dt9nTKn9Ji8Xzaz4tUoMljSlDBJWYoBrprKKSEs6NQcKa0oiMZpzY_uiqtIwb3hek2kpbVqxCpYCsJmQM7k97d8G_720X1cbvQ9tHKpwxjHEmkeyn8GnKBN91wdZqF9xWh4NCUB2tqW9r6mhNna31kPgDGRf18fkYtGv-R-9OqLPW_mRJxDhmjHwBeIh7mQ |
| CODEN | IECMBT |
| CitedBy_id | crossref_primary_10_1109_TCOMM_2023_3347772 crossref_primary_10_1109_TCOMM_2023_3322174 crossref_primary_10_1109_LCOMM_2021_3140100 crossref_primary_10_1109_LSP_2023_3299531 crossref_primary_10_1109_TCOMM_2022_3178764 crossref_primary_10_1186_s13634_022_00855_6 |
| Cites_doi | 10.1109/TCOMM.2017.2715805 10.1109/ALLERTON.2017.8262778 10.1090/S0025-5718-1965-0178586-1 10.1109/MSP.2014.2329131 10.1109/ALLERTON.2018.8636047 10.1109/GLOCOM.2018.8647313 10.1109/TIT.2017.2756959 10.1109/ISIT.2017.8006963 10.1145/2534169.2486028 10.1109/MSP.2014.2329213 10.1021/ac050619p 10.1109/TIT.2006.874390 10.1109/71.238626 10.1145/2517349.2522716 10.1145/2408776.2408794 10.1137/120885887 10.1145/3127479.3128601 10.1145/2342509.2342513 10.1109/TIT.2017.2736066 10.1109/SFCS.2002.1181950 10.1109/INFOCOM.2018.8485811 10.1109/ISIT.2017.8006960 10.1145/2788397 10.1109/GLOCOMW.2016.7848828 10.1561/0100000060 10.1145/1152154.1152155 10.1109/TIFS.2019.2925723 10.1145/1327452.1327492 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M |
| DOI | 10.1109/TCOMM.2020.3016648 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-0857 |
| EndPage | 6628 |
| ExternalDocumentID | 10_1109_TCOMM_2020_3016648 9167266 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: NSERC and Telus Communications Inc |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 ZCA ZCG AAYXX CITATION 7SP 8FD L7M |
| ID | FETCH-LOGICAL-c295t-6131b231f1a4d595377cc18ecbc845473e085dbe67c767c05ae9ebd6d1b806f33 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000591819400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0090-6778 |
| IngestDate | Mon Jun 30 10:21:50 EDT 2025 Sat Nov 29 04:08:19 EST 2025 Tue Nov 18 22:43:33 EST 2025 Wed Aug 27 02:29:38 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c295t-6131b231f1a4d595377cc18ecbc845473e085dbe67c767c05ae9ebd6d1b806f33 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-4478-5973 0000-0002-5997-1093 |
| PQID | 2462224919 |
| PQPubID | 85472 |
| PageCount | 12 |
| ParticipantIDs | ieee_primary_9167266 crossref_primary_10_1109_TCOMM_2020_3016648 crossref_citationtrail_10_1109_TCOMM_2020_3016648 proquest_journals_2462224919 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-11-01 |
| PublicationDateYYYYMMDD | 2020-11-01 |
| PublicationDate_xml | – month: 11 year: 2020 text: 2020-11-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on communications |
| PublicationTitleAbbrev | TCOMM |
| PublicationYear | 2020 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | mallick (ref38) 2018 yu (ref31) 2018 ref34 ref12 ref37 luby (ref40) 6330 jeong (ref15) 2018 ref14 ref33 ref32 ref10 tandon (ref9) 2017 ref2 dimakis (ref35) 1933 ref39 ref17 ref16 ref19 ref18 dutta (ref11) 2016 rao (ref1) 2011 ye (ref30) 2018 yu (ref13) 2017 yan (ref5) 2014; 21 ref24 ref26 (ref43) 2012 ref25 ref20 ref41 ref22 (ref23) 1987; c ref21 ref28 ref29 ref8 ref7 blasco (ref42) 2015 ref4 ref3 ref6 shokrollahi (ref36) 2011; 6 ananthanarayanan (ref27) 2013 |
| References_xml | – year: 2018 ident: ref38 article-title: Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication publication-title: arXiv 1804 10331 – year: 2011 ident: ref1 publication-title: Fast Fourier Transform-Algorithms and Applications – volume: 21 start-page: 88 year: 2014 ident: ref5 article-title: Large-scale image processing research cloud publication-title: Cloud Comput – ident: ref41 doi: 10.1109/TCOMM.2017.2715805 – ident: ref14 doi: 10.1109/ALLERTON.2017.8262778 – ident: ref3 doi: 10.1090/S0025-5718-1965-0178586-1 – ident: ref2 doi: 10.1109/MSP.2014.2329131 – year: 2018 ident: ref31 article-title: Lagrange coded computing: Optimal design for resiliency, security and privacy publication-title: arXiv 1806 00939 – year: 6330 ident: ref40 article-title: RaptorQ forward error correction scheme for object delivery – ident: ref16 doi: 10.1109/ALLERTON.2018.8636047 – ident: ref32 doi: 10.1109/GLOCOM.2018.8647313 – year: 2018 ident: ref15 article-title: Coded FFT and its communication overhead publication-title: arXiv 1805 09891 – start-page: 1 year: 1933 ident: ref35 article-title: Distributed fountain codes for networked storage publication-title: Proc IEEE Int Conf Acoust Speed Signal Process Proc – ident: ref28 doi: 10.1109/TIT.2017.2756959 – ident: ref12 doi: 10.1109/ISIT.2017.8006963 – ident: ref19 doi: 10.1145/2534169.2486028 – year: 2012 ident: ref43 publication-title: Technical Specification Group Services and System Aspects Multimedia Broadcast/Multicast Service Protocols and Codecs – ident: ref4 doi: 10.1109/MSP.2014.2329213 – ident: ref6 doi: 10.1021/ac050619p – ident: ref39 doi: 10.1109/TIT.2006.874390 – ident: ref22 doi: 10.1109/71.238626 – ident: ref18 doi: 10.1145/2517349.2522716 – ident: ref17 doi: 10.1145/2408776.2408794 – ident: ref24 doi: 10.1137/120885887 – ident: ref20 doi: 10.1145/3127479.3128601 – ident: ref25 doi: 10.1145/2342509.2342513 – ident: ref8 doi: 10.1109/TIT.2017.2736066 – ident: ref37 doi: 10.1109/SFCS.2002.1181950 – ident: ref26 doi: 10.1109/INFOCOM.2018.8485811 – volume: c start-page: 581 year: 1987 ident: ref23 article-title: Parallelization and performance analysis of the Cooley-Tukey FFT algorithm for shared-memory architectures publication-title: IEEE Trans Comput – start-page: 4403 year: 2017 ident: ref13 article-title: Polynomial codes: An optimal design for high-dimensional coded matrix multiplication publication-title: Proc Adv Neural Inf Process Syst – ident: ref10 doi: 10.1109/ISIT.2017.8006960 – start-page: 2100 year: 2016 ident: ref11 article-title: Short-dot: Computing large linear transforms distributedly using coded short dot products publication-title: Proc Adv Neural Inf Process Syst – start-page: 3368 year: 2017 ident: ref9 article-title: Gradient coding: Avoiding stragglers in distributed learning publication-title: Proc Int Conf Mach Learn – ident: ref34 doi: 10.1145/2788397 – year: 2018 ident: ref30 article-title: Communication-computation efficient gradient coding publication-title: arXiv 1802 03475 – start-page: 185 year: 2013 ident: ref27 article-title: Effective straggler mitigation: Attack of the clones publication-title: Proc Symp Netw Syst Des Implement – ident: ref29 doi: 10.1109/GLOCOMW.2016.7848828 – volume: 6 start-page: 213 year: 2011 ident: ref36 article-title: Raptor codes publication-title: Found Trends Commun Inf Theory doi: 10.1561/0100000060 – ident: ref21 doi: 10.1145/1152154.1152155 – ident: ref33 doi: 10.1109/TIFS.2019.2925723 – ident: ref7 doi: 10.1145/1327452.1327492 – start-page: 1 year: 2015 ident: ref42 article-title: Enhancing the LT component of Raptor codes for inactivation decoding publication-title: Proc 10th Int ITG Conf Syst Commun Coding |
| SSID | ssj0004033 |
| Score | 2.393336 |
| Snippet | In distributed computing, a number of available helper nodes assist in completing a task for the master node. In such setups, the failure or straggling of even... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 6617 |
| SubjectTerms | Coding Complexity Complexity theory Computer networks Decoding Design optimization Design parameters Discrete Fourier transforms distributed coding Distributed computing Distributed processing Encoding fast Fourier transform Nodes Raptor code Reliability Task analysis |
| Title | A Distributed Low-Complexity Coding Solution for Large-Scale Distributed FFT |
| URI | https://ieeexplore.ieee.org/document/9167266 https://www.proquest.com/docview/2462224919 |
| Volume | 68 |
| WOSCitedRecordID | wos000591819400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0857 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004033 issn: 0090-6778 databaseCode: RIE dateStart: 19720101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5q8aAHX1WsVsnBm8Zm89rssVSDh7YKVugtbHYnIEgjfSj-e2fzqBVF8BDIYXcJM9nMN5uZ7wO4iJQrZBBom7FU2b7noy1lpAnIMSal1EK7qhCb4KNRNJmIhwZcrXphELEoPsNrc1v8y9e5Wpqjsi5BGU4BZQM2OOdlr9ZXD6TjVYyTppydR3WDjCO64_79cEipoEsZKiGc0Gj9rAWhQlXlx6e4iC_x7v-ebA92Khxp9UrH70MDpwewvcYu2IJBz7oxtLhG0Qq1NcjfbbP7DQPm4sPq5yZqWfWxmEXg1RqYsnD7kdyG36bG8fgQnuLbcf_OrsQTbLJ-sKCU0GMpgbeMSV8HIvA4V4pFqFIVGRIvDwls6RRDrjhdTiBRYKpDzdLICTPPO4LmNJ_iMVgcQ7Kj1KkM0ZeSEA26tBxBCeVmmcjawGprJqpiFjcCFy9JkWE4Iik8kBgPJJUH2nC5mvNa8mr8ObplbL4aWZm7DZ3aaUm19eaJ64eEeXzBxMnvs05hy6xdNhR2oLmYLfEMNtXb4nk-Oy_eqk-pUcki |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5qFdSDrypWq-bgTWOzee-xVEPFtApW6C1sdicgSCt9KP57Z9OkVhTBQyCHnSTMZDPfbHa-D-A8lDYXnqdMxlJpuo6LphChIiDHmBBCcWXLXGwi6PXCwYA_VOBy0QuDiPnmM7zSp_m_fDWSM71U1iQoE1BCWYFVz3VtNu_W-uqCtJyCc1JvaA_CskXG4s1--77bpWLQphqVMI6v1X6W0lCuq_LjY5xnmGj7f8-2A1sFkjRa89DvQgWHe7C5xC9Yg7hlXGtiXK1phcqIR--mnv-aA3P6YbRHOm8Z5cKYQfDViPXGcPORAoffTKOovw9P0U2_3TEL-QST_O9NqSh0WErwLWPCVR73nCCQkoUoUxlqGi8HCW6pFP1ABnRYnkCOqfIVS0PLzxznAKrD0RAPwQjQJz8KlQofXSEI06BNlyMwIe0s41kdWOnNRBbc4lri4iXJawyLJ3kEEh2BpIhAHS4WNq9zZo0_R9e0zxcjC3fXoVEGLSkm3ySxXZ9Qj8sZP_rd6gzWO_1unMS3vbtj2ND3mbcXNqA6Hc_wBNbk2_R5Mj7N37BPTGLMaQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Distributed+Low-Complexity+Coding+Solution+for+Large-Scale+Distributed+FFT&rft.jtitle=IEEE+transactions+on+communications&rft.au=Yazdanialahabadi%2C+Arash&rft.au=Ardakani%2C+Masoud&rft.date=2020-11-01&rft.issn=0090-6778&rft.eissn=1558-0857&rft.volume=68&rft.issue=11&rft.spage=6617&rft.epage=6628&rft_id=info:doi/10.1109%2FTCOMM.2020.3016648&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TCOMM_2020_3016648 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon |