期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
一种Hadoop Yarn的资源调度方法研究 被引量:18
1
作者 李媛祯 杨群 +1 位作者 赖尚琦 李博涵 《电子学报》 EI CAS CSCD 北大核心 2016年第5期1017-1024,共8页
针对Hadoop Yarn资源调度问题,为提高集群作业执行效率,提出一种基于蚁群算法与粒子群算法的自适应Hadoop资源调度算法SRSAPH.SRSAPH中,通过Hadoop Yarn跳通信机制获取负载、内存、CPU速度等属性信息初始化信息素矩阵;同时,将粒子群算... 针对Hadoop Yarn资源调度问题,为提高集群作业执行效率,提出一种基于蚁群算法与粒子群算法的自适应Hadoop资源调度算法SRSAPH.SRSAPH中,通过Hadoop Yarn跳通信机制获取负载、内存、CPU速度等属性信息初始化信息素矩阵;同时,将粒子群算法的自我认知能力与社会认知能力引入到蚁群算法,提高算法的收敛速度;此外,根据蚁群算法全局最优解的波动趋势动态调整信息素挥发系数,提高解的精度.实验表明,采用SRSAPH进行资源调度,集群的作业执行时间缩短至少10%. 展开更多
关键词 资源调度 蚁群算法 粒子群算法 HADOOP YARN
下载PDF
A New Congestion-Driven Placement Algorithm Based on Cell Inflation
2
作者 侯文婷 于泓 +3 位作者 洪先龙 蔡懿慈 吴为民 顾钧 《Journal of Semiconductors》 EI CAS CSCD 北大核心 2001年第3期275-282,共8页
A new congestion driven placement Algorithm is described based on the cell inflation. In this approach, the methods of probability estimation and star model are used to evaluate the routing of nets. Global placemen... A new congestion driven placement Algorithm is described based on the cell inflation. In this approach, the methods of probability estimation and star model are used to evaluate the routing of nets. Global placement can be done by using the algorithm of global optimization and slicing partitioning. The denotation of virtual area of cell is given to indicate not only the area of cell but also the routing demand.The virtual area of a cell is got by using the strategy of cell inflation, with which in the slicing partitioning, the routing congestion is eliminated. Further reduction in congestion is achieved by cell moving. The algorithm has been tested on a set of sample circuits from American companies, with great improvement in routablity having been obtained. 展开更多
关键词 CONGESTION probability estimation cell inflation cell moving
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部