Secure and Flexible Coded Distributed Matrix Multiplication Based on Edge Computing for Industrial Metaverse

IF 5.3 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Cloud Computing Pub Date : 2024-06-18 DOI:10.1109/TCC.2024.3415165
Houming Qiu;Kun Zhu;Dusit Niyato
{"title":"Secure and Flexible Coded Distributed Matrix Multiplication Based on Edge Computing for Industrial Metaverse","authors":"Houming Qiu;Kun Zhu;Dusit Niyato","doi":"10.1109/TCC.2024.3415165","DOIUrl":null,"url":null,"abstract":"The Industrial Metaverse is driving a new revolution wave for smart manufacturing domain by reproducing the real industrial environment in a virtual space. Real-time synchronization and rendering of all industrial factors result in numerous time-sensitive and computation-intensive tasks, especially matrix multiplication. Distributed edge computing (DEC) can be exploited to handle these tasks due to its low-latency and powerful computing. In this paper, we propose an efficient and reliable coded DEC framework to compute large-scale matrix multiplication tasks. However, an existence of stragglers causes high computation latency that seriously limits the application of DEC in the Industrial Metaverse. To mitigate the impact of stragglers, we design a secure and flexible PolyDot (SFPD) code, which enables information theoretic security (ITS) protection. Several improvements can be achieved with the proposed SFPD. First, it can achieve a smaller recovery threshold than that of the existing codes in almost all settings. And compared with the original PolyDot codes, our SFPD code considers the extra workers required to add ITS protection. It also provides a flexible tradeoff between recovery threshold and communication & computation loads by simply adjusting two given storage parameters \n<inline-formula><tex-math>$p$</tex-math></inline-formula>\n and \n<inline-formula><tex-math>$t$</tex-math></inline-formula>\n. Furthermore, as an important application scenario, the SFPD code is employed to secure model training in machine learning, which can alleviate the straggler effects and protect ITS of raw data. The experiments demonstrate that the SFPD code can significantly speed up the training process while providing ITS of data. Finally, we provide comprehensive performance analysis which shows the superiority of the SFPD code.","PeriodicalId":13202,"journal":{"name":"IEEE Transactions on Cloud Computing","volume":"12 4","pages":"1026-1041"},"PeriodicalIF":5.3000,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cloud Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10561581/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The Industrial Metaverse is driving a new revolution wave for smart manufacturing domain by reproducing the real industrial environment in a virtual space. Real-time synchronization and rendering of all industrial factors result in numerous time-sensitive and computation-intensive tasks, especially matrix multiplication. Distributed edge computing (DEC) can be exploited to handle these tasks due to its low-latency and powerful computing. In this paper, we propose an efficient and reliable coded DEC framework to compute large-scale matrix multiplication tasks. However, an existence of stragglers causes high computation latency that seriously limits the application of DEC in the Industrial Metaverse. To mitigate the impact of stragglers, we design a secure and flexible PolyDot (SFPD) code, which enables information theoretic security (ITS) protection. Several improvements can be achieved with the proposed SFPD. First, it can achieve a smaller recovery threshold than that of the existing codes in almost all settings. And compared with the original PolyDot codes, our SFPD code considers the extra workers required to add ITS protection. It also provides a flexible tradeoff between recovery threshold and communication & computation loads by simply adjusting two given storage parameters $p$ and $t$ . Furthermore, as an important application scenario, the SFPD code is employed to secure model training in machine learning, which can alleviate the straggler effects and protect ITS of raw data. The experiments demonstrate that the SFPD code can significantly speed up the training process while providing ITS of data. Finally, we provide comprehensive performance analysis which shows the superiority of the SFPD code.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于边缘计算的安全灵活编码分布式矩阵乘法,适用于工业元宇宙
工业元宇宙通过在虚拟空间中再现真实工业环境,正在推动智能制造领域的新革命浪潮。所有工业因素的实时同步和渲染导致了大量的时间敏感和计算密集型任务,特别是矩阵乘法。分布式边缘计算(DEC)由于其低延迟和强大的计算能力,可以用来处理这些任务。本文提出了一种高效可靠的编码DEC框架来计算大规模矩阵乘法任务。然而,由于离散体的存在,导致了较高的计算延迟,严重限制了DEC在工业元宇宙中的应用。为了减轻掉队者的影响,我们设计了一个安全灵活的PolyDot (SFPD)代码,它可以实现信息理论安全(ITS)保护。提出的SFPD可以实现若干改进。首先,在几乎所有的设置下,它都能实现比现有代码更小的恢复阈值。与原来的PolyDot代码相比,我们的SFPD代码考虑了增加ITS保护所需的额外工人。它还通过简单地调整两个给定的存储参数$p$和$t$,在恢复阈值和通信&计算负载之间提供了灵活的权衡。此外,SFPD代码作为一种重要的应用场景,用于机器学习中的模型训练,可以减轻离散效应,保护原始数据的ITS。实验表明,SFPD代码在提供数据ITS的同时,可以显著加快训练过程。最后,对SFPD代码进行了全面的性能分析,证明了SFPD代码的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Cloud Computing
IEEE Transactions on Cloud Computing Computer Science-Software
CiteScore
9.40
自引率
6.20%
发文量
167
期刊介绍: The IEEE Transactions on Cloud Computing (TCC) is dedicated to the multidisciplinary field of cloud computing. It is committed to the publication of articles that present innovative research ideas, application results, and case studies in cloud computing, focusing on key technical issues related to theory, algorithms, systems, applications, and performance.
期刊最新文献
COCSN: A Multi-Tiered Cascaded Optical Circuit Switching Network for Data Center Aggregate Monitoring for Geo-Distributed Kubernetes Cluster Federations Group Formation and Sampling in Group-Based Hierarchical Federated Learning HEXO: Offloading Long-Running Compute- and Memory-Intensive Workloads on Low-Cost, Low-Power Embedded Systems Joint Offloading and Resource Allocation for Collaborative Cloud Computing With Dependent Subtask Scheduling on Multi-Core Server
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1