期刊文献+

一种针对非平稳网络任务调度防冲突算法研究 被引量:12

Non-Stationary Network Scheduling Anti-Collision Algorithm Research
在线阅读 下载PDF
导出
摘要 利用传统算法进行非平稳网络任务调度,由于非平稳网络的随机性增加,很难建立准确的任务调度模型,导致任务调度的失败。为了避免上述缺陷,提出了一种基于二叉树搜索算法的非平稳网络任务调度防冲突方法。根据非平稳网络中的相关参数,对网络信道中的数据量进行预测。利用二叉树搜索方法,对非平稳网络任务调度进行防冲突运算。实验结果表明,利用本文算法进行非平稳网络任务调度防冲突运算,能够极大地提高非平稳网络任务调度防冲突的准确性,保证了非平稳网络的性能。 Using traditional non-stationary network task scheduling algorithm, due to the non-stationary random network increases, it is difficult to establish accurate task scheduling model, lead to the failure of the task scheduling. In order to avoid the above defects, puts forward a search algorithm based on binary tree method of non-stationary network scheduling conflict prevention. According to the non-stationary parameters within the network, to forecast the amount Of data in the network channel. Using binary tree search method, the non-stationary network task scheduling for anti-collision algorithm. Experimental results show that the algorithm presented in this paper for non-stationary network scheduling conflict prevention operations, can greatly improve the accuracy of the non-stationary network scheduling conflict prevention, ensure the non-stationary network performance.
出处 《科技通报》 北大核心 2013年第10期143-145,共3页 Bulletin of Science and Technology
基金 基金项目:E-fly-868-GQ闯红灯自动记录系统(wk200909008)
关键词 非平稳网络 任务调度 防冲突 non-stationary network task scheduling prevent conflict
  • 相关文献

参考文献5

  • 1CHIEN A, CALDER B, ELBERT S,et ol. Entropia: Ar-chitecture and Performance of An Enterprise DesktopGrid System [J]. Journal of Parallel and Distributed Com-puting, 2003, 63(5):597-610.
  • 2ROCHWERGER B, BREITGAND D,LEVY E, et d. TheReservoir Model and Architec -ture for Open FederatedCloud ComputingfJ]. IBM Journal of Research and Devel-opment, 2009, 53(4):1-17.
  • 3ALI S,SIEGEL H J, MAHESWARAN M, et al. Repre-senting Task and Machine Heterogen -eities for Hetero-geneous Computing systems [J]. Journal of Science andEngineering, 2000, 3(3): 195-207.
  • 4乌岚.基于多样约束模型的远程教育数据库优化查询算法[J].科技通报,2013,29(1):154-156. 被引量:35
  • 5王刚,钟志水,黄永青.基于蚁群遗传算法的网格资源调度研究[J].计算机仿真,2009,26(4):240-243. 被引量:24

二级参考文献14

共引文献57

同被引文献41

  • 1Soelistijanto B,Howarth M.Traffic Distribution and Network Capacity Analysis in Social Opportunistic Networks[C] //In:IEEE 8th International Conference on Wireless and Mobile Computing,Networking and Communications(WiMob),Barcelona,2012:823-830.
  • 2MIORANDI D,SICARI S,PELLEGRINI F D,et al.Internet of things:vision,applications and research challenges[J].Ad Hoc Networks,2012,10(7):1497-1516.
  • 3Yujia Ge,Guiyi Wei.GA-Based Task Scheduler for the Cloud Computing Systems[C]//Web Information Systems and Mining(WISM),Sanya:IEEE,2010.
  • 4Gan Guo-ning,Huang Ting-lei,Gao Shuai.Genetic simulated annealing algorithm for task scheduling based on cloud computing environment[C]//Intelligent Computing and Integrated Systems(ICISS),Guilin:IEEE,2010.
  • 5CHONG S K,GABER M M,KRISHNASWAMY S,et al.Energy Conservation in Wireless Sensor Networks:a Rule-based Approach[J].Knowledge and Information Systems,2011,28(3):579-614.
  • 6Soelistijanto, B., Howarth, M.. Traffic Distribution and Net-work Capacity Analysis in Social Opportunistic Networks[C]//In: IEEE 8th International Conference on Wireless andMobile Computing, Networking and Communications(WiMob), Barcelona, 2012: 823-830.
  • 7Miorandi D, Sicari S, Pellegrini FD, et al. Internet ofthings: vision, applications and research challenges[J]. AdHoc Networks, 2012, 10(7):1497-1516.
  • 8Chong SK, Gaber MM, Krishnaswamy S, et al. Energy con-servation in wireless sensor networks: a rule- based ap-proach[J]. Knowledge and Information Systems,2011,28(3):579-614.
  • 9Miorandi D, Sicari S,Pellegrini F D, et al. Internet of things:vi- sion, applications and research challenges [J]. Ad Hoc Net- works, 2012,10(7) : 1497-1516.
  • 10Chong S K, Gaber M M, Krishnaswamy S, et al. Energy conser- vation in wireless sensor networks: a rule-based approach[J]. Knowledge and Information Systems,2011,28(3):579-614.

引证文献12

二级引证文献36

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部