Factored LT and Factored Raptor Codes for Large-Scale Distributed Matrix Multiplication

被引：0
|
作者：
Pradhan, Asit Kumar [1 ]
Heidarzadeh, Anoosheh [1 ]
Narayanan, Krishna R. [1 ]
机构：
[1] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77843 USA
来源：
2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2020年
基金：
美国国家科学基金会;
关键词：
D O I：
10.1109/isit44484.2020.9174314
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We propose two coding schemes for distributed matrix multiplication in the presence of stragglers. These coding schemes are adaptations of LT codes and Raptor codes to distributed matrix multiplication and are termed Factored LT (FLT) codes and Factored Raptor (FR) codes. Empirically, we show that FLT codes have a near-optimal recovery threshold when the number of worker nodes is very large, and that FR codes have an excellent recovery threshold while the number of worker nodes is moderately large. FLT and FR codes have better recovery thresholds when compared to Product codes and they are expected to have better numerical stability when compared to Polynomial codes, while they can also be decoded with a low-complexity decoding algorithm.
引用
收藏
页码：239 / 244
页数：6
相关论文
共 50 条
  • [21] Secure and Efficient Protocol for Outsourcing Large-Scale Matrix Multiplication to the Cloud
    Wu, Yu
    Liao, Yongjian
    Liang, Yikuan
    Liu, Yulu
    IEEE ACCESS, 2020, 8 : 227556 - 227565
  • [22] Hierarchical approach to optimization of parallel matrix multiplication on large-scale platforms
    Khalid Hasanov
    Jean-Noël Quintin
    Alexey Lastovetsky
    The Journal of Supercomputing, 2015, 71 : 3991 - 4014
  • [23] Improving performance of sparse matrix dense matrix multiplication on large-scale parallel systems
    Acer, Seher
    Selvitopi, Oguz
    Aykanat, Cevdet
    PARALLEL COMPUTING, 2016, 59 : 71 - 96
  • [24] Bivariate Polynomial Codes for Secure Distributed Matrix Multiplication
    Hasircioglu, Burak
    Gomez-Vilardebo, Jesus
    Gunduz, Deniz
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2022, 40 (03) : 955 - 967
  • [25] BYZANTINE-RESILIENT DISTRIBUTED LARGE-SCALE MATRIX COMPLETION
    Lin, Feng
    Ling, Qing
    Xiong, Zhiwei
    2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2019, : 8167 - 8171
  • [26] A novel publicly delegable secure outsourcing algorithm for large-scale matrix multiplication
    Kumar, Malay
    Mishra, Vaibhav
    Shukla, Anurag
    Singh, Munendra
    Vardhan, Manu
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2020, 38 (05) : 6445 - 6455
  • [27] Sparstition: A Partitioning Scheme for Large-Scale Sparse Matrix Vector Multiplication on FPGA
    Sigurbergsson, Bjorn
    Hogervorst, Tom
    Tong Dong Qiu
    Nane, Razvan
    2019 IEEE 30TH INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS (ASAP 2019), 2019, : 51 - 58
  • [28] swSpAMM: optimizing large-scale sparse approximate matrix multiplication on Sunway Taihulight
    LIU Xiaoyan
    LIU Yi
    YIN Bohong
    YANG Hailong
    LUAN Zhongzhi
    QIAN Depei
    Frontiers of Computer Science, 2023, 17 (04)
  • [29] MALMM: A multi-array architecture for large-scale matrix multiplication on FPGA
    Huang, You
    Shen, Junzhong
    Qiao, Yuran
    Wen, Mei
    Zhang, Chunyuan
    IEICE ELECTRONICS EXPRESS, 2018, 15 (10):
  • [30] swSpAMM: optimizing large-scale sparse approximate matrix multiplication on Sunway Taihulight
    Liu, Xiaoyan
    Liu, Yi
    Yin, Bohong
    Yang, Hailong
    Luan, Zhongzhi
    Qian, Depei
    FRONTIERS OF COMPUTER SCIENCE, 2023, 17 (04)
12345