有限块长度下基于tdma的多用户二进制计算卸载

M. A. Manouchehrpour, Harvinder Lehal, Mahsa Salmani, T. Davidson
{"title":"有限块长度下基于tdma的多用户二进制计算卸载","authors":"M. A. Manouchehrpour, Harvinder Lehal, Mahsa Salmani, T. Davidson","doi":"10.1109/ICASSP49357.2023.10095862","DOIUrl":null,"url":null,"abstract":"Multi-user computation offloading inherently involves the allocation of communication resources among the offloading devices. Since the devices require timely results, that allocation ought to be guided by the fundamental rate limits for finite block lengths, rather than the classical (asymptotic) limits. We develop an efficient algorithm for such an allocation. It includes a relaxation-rounding approach that is based on a customized incremental rounding scheme for the block lengths. A special feature is that the relaxation is tightened in such a way that rounding a feasible solution to the relaxed problem is guaranteed to generate a feasible integer block length. By exploiting a closed-form approximation of the transmission powers, our design approach reduces to successively solving convex approximation problems over the transmission rates alone.","PeriodicalId":113072,"journal":{"name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"TDMA-Based Multi-User Binary Computation Offloading in the Finite-Block-Length Regime\",\"authors\":\"M. A. Manouchehrpour, Harvinder Lehal, Mahsa Salmani, T. Davidson\",\"doi\":\"10.1109/ICASSP49357.2023.10095862\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi-user computation offloading inherently involves the allocation of communication resources among the offloading devices. Since the devices require timely results, that allocation ought to be guided by the fundamental rate limits for finite block lengths, rather than the classical (asymptotic) limits. We develop an efficient algorithm for such an allocation. It includes a relaxation-rounding approach that is based on a customized incremental rounding scheme for the block lengths. A special feature is that the relaxation is tightened in such a way that rounding a feasible solution to the relaxed problem is guaranteed to generate a feasible integer block length. By exploiting a closed-form approximation of the transmission powers, our design approach reduces to successively solving convex approximation problems over the transmission rates alone.\",\"PeriodicalId\":113072,\"journal\":{\"name\":\"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP49357.2023.10095862\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP49357.2023.10095862","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多用户计算卸载本质上涉及到在卸载设备之间分配通信资源。由于设备需要及时的结果,分配应该以有限块长度的基本速率限制为指导,而不是经典的(渐近的)限制。我们为这种分配开发了一个有效的算法。它包括基于块长度的自定义增量舍入方案的松弛舍入方法。一个特殊的特征是,松弛被收紧,使得松弛问题的可行解的四舍五入保证生成可行的整数块长度。通过利用传输功率的封闭近似,我们的设计方法简化为在传输速率上连续解决凸近似问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
TDMA-Based Multi-User Binary Computation Offloading in the Finite-Block-Length Regime
Multi-user computation offloading inherently involves the allocation of communication resources among the offloading devices. Since the devices require timely results, that allocation ought to be guided by the fundamental rate limits for finite block lengths, rather than the classical (asymptotic) limits. We develop an efficient algorithm for such an allocation. It includes a relaxation-rounding approach that is based on a customized incremental rounding scheme for the block lengths. A special feature is that the relaxation is tightened in such a way that rounding a feasible solution to the relaxed problem is guaranteed to generate a feasible integer block length. By exploiting a closed-form approximation of the transmission powers, our design approach reduces to successively solving convex approximation problems over the transmission rates alone.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信