基于TrustZone的边缘云中的依赖感知任务调度

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Yuepeng Li;Deze Zeng
{"title":"基于TrustZone的边缘云中的依赖感知任务调度","authors":"Yuepeng Li;Deze Zeng","doi":"10.1109/TSUSC.2023.3278655","DOIUrl":null,"url":null,"abstract":"Task offloading to edge servers has become a promising solution to tackle the computation resource poverty of the end devices. However, the zero-trust edge computing platform is highly challenged by the growing concern on security and privacy. Thus, Trust Execution Environment (TEE), like TrustZone, is advocated to empower edge clouds to enable secure task offloading. To explore TrustZone, the inevitable involvement of data encryption and decryption operations makes existing offloading strategies not applicable any more, especially when the task dependency is considered. In addition, TrustZone has distinguishable task scheduling paradigm as one CPU core does not allow multitask coexist at the same time. Taking the above issues into consideration, we investigate a dependency-aware task offloading problem for makespan minimization in TrustZone empowered edge clouds. By inventing an extended graph to describe the task execution process, we provide a formal statement to the problem and prove its NP-hardness. We then propose a Customized List Scheduling (CLS) based approximate algorithm and theoretically analyze its achievable performance. Extensive testbed based experiment results show that our approximation algorithm can effectively reduce the makespan and significantly outperforms existing state-of-the-art offloading approaches in TrustZone empowered edge clouds.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"8 3","pages":"423-434"},"PeriodicalIF":3.0000,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dependency-Aware Task Scheduling in TrustZone Empowered Edge Clouds for Makespan Minimization\",\"authors\":\"Yuepeng Li;Deze Zeng\",\"doi\":\"10.1109/TSUSC.2023.3278655\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Task offloading to edge servers has become a promising solution to tackle the computation resource poverty of the end devices. However, the zero-trust edge computing platform is highly challenged by the growing concern on security and privacy. Thus, Trust Execution Environment (TEE), like TrustZone, is advocated to empower edge clouds to enable secure task offloading. To explore TrustZone, the inevitable involvement of data encryption and decryption operations makes existing offloading strategies not applicable any more, especially when the task dependency is considered. In addition, TrustZone has distinguishable task scheduling paradigm as one CPU core does not allow multitask coexist at the same time. Taking the above issues into consideration, we investigate a dependency-aware task offloading problem for makespan minimization in TrustZone empowered edge clouds. By inventing an extended graph to describe the task execution process, we provide a formal statement to the problem and prove its NP-hardness. We then propose a Customized List Scheduling (CLS) based approximate algorithm and theoretically analyze its achievable performance. Extensive testbed based experiment results show that our approximation algorithm can effectively reduce the makespan and significantly outperforms existing state-of-the-art offloading approaches in TrustZone empowered edge clouds.\",\"PeriodicalId\":13268,\"journal\":{\"name\":\"IEEE Transactions on Sustainable Computing\",\"volume\":\"8 3\",\"pages\":\"423-434\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2023-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Sustainable Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10138364/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Sustainable Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10138364/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

将任务卸载到边缘服务器已成为解决终端设备计算资源匮乏问题的一种很有前途的解决方案。然而,由于对安全和隐私的日益关注,零信任边缘计算平台受到了极大的挑战。因此,信任执行环境(TEE)与TrustZone一样,被提倡为边缘云提供功能,以实现安全的任务卸载。为了探索TrustZone,不可避免地涉及数据加密和解密操作,使得现有的卸载策略不再适用,尤其是在考虑任务依赖性时。此外,TrustZone具有可区分的任务调度模式,因为一个CPU核心不允许同时存在多任务。考虑到上述问题,我们研究了一个在TrustZone授权的边缘云中实现最大化的依赖感知任务卸载问题。通过发明一个扩展图来描述任务执行过程,我们为这个问题提供了一个形式化的陈述,并证明了它的NP硬度。然后,我们提出了一种基于定制列表调度(CLS)的近似算法,并从理论上分析了其可实现的性能。大量基于试验台的实验结果表明,我们的近似算法可以有效地缩短完工时间,并显著优于TrustZone授权边缘云中现有的最先进的卸载方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dependency-Aware Task Scheduling in TrustZone Empowered Edge Clouds for Makespan Minimization
Task offloading to edge servers has become a promising solution to tackle the computation resource poverty of the end devices. However, the zero-trust edge computing platform is highly challenged by the growing concern on security and privacy. Thus, Trust Execution Environment (TEE), like TrustZone, is advocated to empower edge clouds to enable secure task offloading. To explore TrustZone, the inevitable involvement of data encryption and decryption operations makes existing offloading strategies not applicable any more, especially when the task dependency is considered. In addition, TrustZone has distinguishable task scheduling paradigm as one CPU core does not allow multitask coexist at the same time. Taking the above issues into consideration, we investigate a dependency-aware task offloading problem for makespan minimization in TrustZone empowered edge clouds. By inventing an extended graph to describe the task execution process, we provide a formal statement to the problem and prove its NP-hardness. We then propose a Customized List Scheduling (CLS) based approximate algorithm and theoretically analyze its achievable performance. Extensive testbed based experiment results show that our approximation algorithm can effectively reduce the makespan and significantly outperforms existing state-of-the-art offloading approaches in TrustZone empowered edge clouds.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Sustainable Computing
IEEE Transactions on Sustainable Computing Mathematics-Control and Optimization
CiteScore
7.70
自引率
2.60%
发文量
54
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信