检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王红艳 孙其博[1] 马骁 周傲[1] 王尚广[1] WANG Hongyan;SUN Qibo;MA Xiao;ZHOU Ao;WANG Shangguang(State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China)
机构地区:[1]北京邮电大学网络与交换技术国家重点实验室,北京100876
出 处:《通信学报》2024年第6期144-159,共16页Journal on Communications
基 金:国家自然科学基金资助项目(No.62032003,No.U21B2016,No.62372061,No.61921003)。
摘 要:针对无线设备资源受限导致状态提取滞后难以满足实时应用对信息新鲜度需求的问题,考虑到边缘节点处理容量的有限性,提出了一种联合考虑信息新鲜度与调度实时性的调度方法。该方法首先利用队列的系统时间和信息年龄分别刻画任务在计算之前的时延和计算之后的信息新鲜度,同时给每个卸载任务合理的截止期限,来保证任务进入计算过程之前的有效性。然后,采用最小处理速率约束方法对任务调度过程中的处理速率进行约束,保证任务调度的实时性。最后,基于Lyapunov优化技术实现优化长期任务调度决策的目的。仿真结果表明,所提方法在调度实时性和系统信息新鲜度方面均具有较好的性能。To address the issue where the resource limitations of wireless devices caused state extraction delays that cannot meet the freshness requirements of real-time applications,considering the limited processing capacity of edge nodes,a scheduling method that jointly considered information freshness and real-time performance was proposed.This method initially characterized the task delay before computation and the information freshness after computation by utilizing the system time of the queue and the age of information,respectively.Simultaneously,reasonable deadlines were assigned to each offloaded task to ensure their validity before entering the computation process.Then,the minimum processing rate constraint method was employed to restrict the processing rate during task scheduling,thereby ensuring the real-time nature of task scheduling.Finally,the objective of optimizing long-term task scheduling decisions was achieved based on Lyapunov optimization techniques.Simulation results demonstrate the good performance of the proposed method in both scheduling timeliness and system information freshness.
关 键 词:边缘计算 信息年龄 任务调度 截止期限 Lyapunov优化
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.137.159.67