首页 | 本学科首页   官方微博 | 高级检索  
     

基于冗余任务消减的边缘应用性能优化
引用本文:宋煜,张帅,严永辉,钱柱中. 基于冗余任务消减的边缘应用性能优化[J]. 计算机工程, 2021, 47(3): 209-217,226. DOI: 10.19678/j.issn.1000-3428.0055883
作者姓名:宋煜  张帅  严永辉  钱柱中
作者单位:1. 江苏方天电力技术有限公司, 南京 211102;2. 南京大学 计算机软件新技术国家重点实验室, 南京 210023;3. 南京大学 软件新技术与产业化协同创新中心, 南京 210023
基金项目:江苏省自然科学基金面上项目"基于模式挖掘的边缘云资源调度技术研究";国家自然科学基金面上项目"面向多边缘云的资源调度与协作技术研究"
摘    要:在增强现实应用中,距离较近的多个用户请求很可能是相似或者相同的,从而导致同样的计算任务被重复执行.针对该问题,设计基于冗余任务消减的计算任务缓存系统.通过在边缘节点设计任务缓存,使边缘服务器以自组织方式维护全局缓存.对客户端请求时延、用户轨迹、节点部署和总时延进行建模,基于此研究基站上边缘服务器的计算资源部署问题,在给...

关 键 词:增强现实  边缘计算  冗余任务  动态规划  聚类
收稿时间:2019-12-26
修稿时间:2020-03-03

Application Performance Optimization in Edge Computing Scenario Based on Redundant Task Reduction
SONG Yu,ZHANG Shuai,YAN Yonghui,QIAN Zhuzhong. Application Performance Optimization in Edge Computing Scenario Based on Redundant Task Reduction[J]. Computer Engineering, 2021, 47(3): 209-217,226. DOI: 10.19678/j.issn.1000-3428.0055883
Authors:SONG Yu  ZHANG Shuai  YAN Yonghui  QIAN Zhuzhong
Affiliation:1. Jiangsu Frontier Electric Technology Co., Ltd., Nanjing 211102, China;2. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China;3. Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing University, Nanjing 210023, China
Abstract:In Augmented Reality(AR)applications,user requests that are geographically close to each other might be similar or identical,leading to repeated task execution.To address the problem,this paper designs a cache system for computation tasks based on redundant task reduction.Task cache is designed for the edge nodes,making the edge servers maintain the global cache in a self-organized way,and the client request latency,user trajectory,node deployment and total latency are mathematically modeled.On this basis,this paper studies the computation resource deployment of edge servers in base stations,optimizing the average request delay under a given deployment cost.The deployment problem is simplified to an integer nonlinear programming problem,and then two algorithms are presented:Integral Delay Minimization(IDM)for medium and small scale scenarios,and Large-scale Delay Minimization(LDM)for large scale scenarios.Experimental results show that the difference between the average delay of the IDM algorithm and that of the optimal solution is only 5.85%,which means the proposed algorithm has a very good approximation effect on the optimal solution.Compared with the IDM algorithm,the LDM algorithm reduces running time by 98.15%at the expense of 9.20%longer average delay,greatly reducing the running cost.
Keywords:Augmented Reality(AR)  edge computing  redundant task  dynamic programming  clustering
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号