【24h】

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.
机译:这项工作考虑了使用master-worker框架的分布式多元多项式评估(DMPE)问题,该框架最初由Yu等人考虑,其中提出了Lagrange编码计算(LCC)作为编码计算方案,以提供针对散兵的弹性。 DMPE问题。在这项工作中,我们结合了经典产品代码和LCC的思想,提出了LCC方案的一种变体,称为产品拉格朗日编码计算(PLCC)。 PLCC的主要优点是它们在数值上比LCC更稳定。但是,它们对流浪者的适应能力欠佳。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号