摘要
针对对等网络环境下任务调度中的网络动态性问题,以最小化任务完成时间为目标,提出了一种动态调度策略。设计了获取节点性能并估算节点间传输延迟的Request和Response协议;引入了Check Point技术来缓解网络动态性对调度性能的影响。在此基础上,通过任务类与节点类的资源匹配度为任务分配节点,同时采用所提出的动态调度算法完成调度过程。实验结果表明,所提算法在执行时间上优于HNPD,FCBSH,MPCGSR以及TSIA算法,并且随着节点退出率的增加,算法的优越性也越来越明显。
To deal with the network dynamic problems in task scheduling under the peer to peer network environment,and aimed at minimum overall run-time of tasks,a dynamic task scheduling strategy was proposed.The Request and Response protocols were designed to obtain node performance as well as to estimate the transmission delay among nodes in the target network.The Check Point technique was introduced to relieve the impact on scheduling performance caused by network dynamic.On that basis,the nodes were assigned for task by taking resource matching between task class and node class,and the scheduling process was completed by proposed dynamic scheduling algorithm.The experimental results showed that proposed algorithm outperformed HNPD,FCBSH,MPCGSR and TSIA algorithms in terms of execution time.Besides,with the increase of the leaving rate of nodes,the advantage of the algorithm improved obviously.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2011年第9期1929-1937,共9页
Computer Integrated Manufacturing Systems
基金
国家自然科学基金资助项目(60973014)~~
关键词
对等网络
任务调度
动态性
执行时间
peer to peer network
task scheduling
dynamics
execution time
