基于混沌最优博弈的网络任务调度算法仿真.pdfVIP

2013 年 11 月 第30 卷第11 期 计算机仿真 文章编号: 1晰-9348(2013 ) 11 -0293 -04 基于混沌最优博弈的网络任务调度算法仿真 陈艇 (汕头大学计31:机系，广东汕头 5 15031 ) 摘要:研究网络调度优化问题，延迟容忍、网络环搅具有动态性、异构性等特点，异构网络中网络节点缺少相互支撑，网络任务 关联位不强，造成网络节点任务调度顺序的最优跨度计算过程中，由于动态参数过多导致i~t-算结果失豆豆.导致传统网格任务 调度算法效率低。 为了提高网格任务调度效率，提出一种混沌i尊弈的网络任务调度1):法。 在传统1):法加入1昆沌博弈论理 论，在i十算出绩优跨度、网络资源利用率和网络负载三个参数后，加入一种博弈因子，对参数在~~.Qi优约束条件下进行校验， 运用混沌位子群算法对校验后的精度进行混沌约束优化计fj:，保i正在参数信息非优的俯况下，计算出博型军战优调度步 长，克服由于网络异构带来的步i~计算不准的弊端。 实验结果表明，改进方法提高了任务调度的速度和效率。 关键词:容忍计算; 任务调度;混沌博弈 中图分类号: TP391. 9 文献标识码:B Simulation of Network T割k Scheduling Algorithm Based on Chaos Optimal Game CHEN Ting (Shantou University Computer Science Department. Shantou Guangdong 515031 , China) ABSTRACT: Delay to1erant network environment has many c haracteristics , such as dynarnics , heterogeneity , net- work nodes in heterogeneous network s are lack of mutual support , correlation is not strong , and it is difficult to accu- rately define the optimal span of the network nodes task scheduling 0时时， which leads to the s low efficiency of tradi- tional grid task scheduling a1gorithm. In order to improve the efficiency of grid task scheduling , a network task sched- uling algorithm based on chaos game was pul forward in this paper. The chaos game lheory was added in the tradition- al algorilhm , afler calculaling three parameters , lhe optimal span . network resource utilization and network Ioad , a game factor was added 10 calibrale lhe parameters in the sub - optimal constraint conditions. Th