产品拉格朗日编码计算

Adarsh M. Subramaniam, A. Heidarzadeh, A. K. Pradhan, K. Narayanan
{"title":"产品拉格朗日编码计算","authors":"Adarsh M. Subramaniam, A. Heidarzadeh, A. K. Pradhan, K. Narayanan","doi":"10.1109/ISIT44484.2020.9174440","DOIUrl":null,"url":null,"abstract":"This work considers the distributed multivariate polynomial evaluation (DMPE) problem using a master-worker framework, which was originally considered by Yu et al., where Lagrange Coded Computing (LCC) was proposed as a coded computation scheme to provide resilience against stragglers for the DMPE problem. In this work, we propose a variant of the LCC scheme, termed Product Lagrange Coded Computing (PLCC), by combining ideas from classical product codes and LCC. The main advantage of PLCC is that they are more numerically stable than LCC; however, their resilience to stragglers is sub-optimal.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Product Lagrange Coded Computing\",\"authors\":\"Adarsh M. Subramaniam, A. Heidarzadeh, A. K. Pradhan, K. Narayanan\",\"doi\":\"10.1109/ISIT44484.2020.9174440\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work considers the distributed multivariate polynomial evaluation (DMPE) problem using a master-worker framework, which was originally considered by Yu et al., where Lagrange Coded Computing (LCC) was proposed as a coded computation scheme to provide resilience against stragglers for the DMPE problem. In this work, we propose a variant of the LCC scheme, termed Product Lagrange Coded Computing (PLCC), by combining ideas from classical product codes and LCC. The main advantage of PLCC is that they are more numerically stable than LCC; however, their resilience to stragglers is sub-optimal.\",\"PeriodicalId\":159311,\"journal\":{\"name\":\"2020 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT44484.2020.9174440\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT44484.2020.9174440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

这项工作考虑了使用主工框架的分布式多元多项式评估(DMPE)问题,该框架最初由Yu等人考虑,其中拉格朗日编码计算(LCC)被提出作为一种编码计算方案,为DMPE问题提供针对离散者的弹性。在这项工作中,我们提出了LCC方案的一种变体,称为产品拉格朗日编码计算(PLCC),通过结合经典产品代码和LCC的思想。PLCC的主要优点是它们在数值上比LCC更稳定;然而,他们对掉队者的适应能力不是最优的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Product Lagrange Coded Computing
This work considers the distributed multivariate polynomial evaluation (DMPE) problem using a master-worker framework, which was originally considered by Yu et al., where Lagrange Coded Computing (LCC) was proposed as a coded computation scheme to provide resilience against stragglers for the DMPE problem. In this work, we propose a variant of the LCC scheme, termed Product Lagrange Coded Computing (PLCC), by combining ideas from classical product codes and LCC. The main advantage of PLCC is that they are more numerically stable than LCC; however, their resilience to stragglers is sub-optimal.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信