检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马腾[1] 胡宇翔[1] 张校辉[1] MA Teng;HU Yu-xiang;ZHANG Xiao-hui(National Digital Switching System Engineering & Technology Research Center,Zhengzhou,Henan 450002,Chin)
机构地区:[1]国家数字交换系统工程技术研究中心,河南郑州450002
出 处:《电子学报》2018年第7期1617-1624,共8页Acta Electronica Sinica
基 金:国家973重点基础研究发展计划(No.2013CB329104);国家863高技术研究发展计划(No.2013AA013505)
摘 要:最小化语义相关流的平均完成时间是数据中心网络流量管理面临的难题之一.受人工智能领域深度增强学习方向的最新研究进展启发,本文提出一种的新的语义相关流调度机制.将带宽约束的语义相关流调度问题转化为连续的学习过程,通过学习以往策略实现最佳调度.引入反向填充和有限复用机制,保证系统的工作保持性和无饥饿性.仿真结果表明,在不同的网络负载下,本文提出的调度机制均使得语义相关流的平均完成时间小于其他调度机制,尤其是网络负载较大时,相比最先进的调度机制,性能提升约50%.Coflow completion time minimization is one of the challenges of traffic management in data center networks. Inspired by the newest research progress in deep reinforcement learning,which is one direction of artificial intelligence,this paper proposes a novel coflow scheduling mechanism. It translates the coflow scheduling problem with bandwidth constraint into a continuous learning process. By learning the previous decisions,the best scheduling is obtained. By introducing back filling and limited multiplexing mechanisms,the system is work-conserving and starvation-free. Simulation results showthat,under different network load,compared with other scheduling mechanisms,the average coflow completion time is reduced. Especially when the network load is heavy,the proposed mechanism achieves about 50% performance improvement than the state-of-the-art scheduling mechanism.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.193