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}
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.