期刊文献+

基于概率冗余调度的可靠P2P计算模型 被引量:3

Reliable P2P Computing Model Based on Probabilistic Redundant Scheduling
在线阅读 下载PDF
导出
摘要 为了实现动态、不稳定环境下的可靠P2P计算,提出了一种基于概率冗余调度的可靠P2P计算模型.该模型利用P2P任务调度成功率与资源稳定性、资源冗余度之间的概率关系计算任务调度的优化冗余度,不仅能获得较好的任务调度性能,而且在概率上保证了系统任务调度的可靠性.文中还设计了基于概率冗余的可靠任务调度算法,实验结果验证了提出的模型和算法的有效性. In order to implement reliable peer-to-peer(P2P) computation in dynamic and unstable environments,a reliable P2P computing model based on the probabilistic redundant scheduling is established.In this model,the relationship among the success rate of P2P scheduling,the resource stability and the resource redundancy is used to obtain an optimal redundancy of task scheduling,improve the scheduling performance,and guarantee the reliability of P2P scheduling by probability.Moreover,a reliable probabilistic redundancy-based algorithm for task scheduling is designed,and the effectiveness of the proposed model and algorithm are validated by experiments.
出处 《华南理工大学学报(自然科学版)》 EI CAS CSCD 北大核心 2010年第6期84-88,共5页 Journal of South China University of Technology(Natural Science Edition)
基金 广东省中国科学院全面战略合作项目(x2jsF7091990) 华南理工大学中央高校基本科研业务费专项资金资助项目(2009ZM0103)
关键词 概率 冗余调度 可靠性 对等网络 probability redundant scheduling reliability peer-to-peer
  • 相关文献

参考文献12

  • 1Anderson D P,Cobb J,Korpela E,et al.Seti@home:an experiment in public-resource computing[J].Communications of the ACM,2002,45(11):56-61.
  • 2Jia A L,Chiu D M.Designs and evaluation of a tracker in P2P networks[C] ∥Proceedings of the 8th International Conference on Peer-to-Peer Computing.Aachen:IEEE,2008:227-230.
  • 3Anderson D P.BOINC:a system for public-resource computing and storage[C] ∥Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing.Pittsburgh:IEEE,2004:4-10.
  • 4Cappello F,Djilali S,Fedak G,et al.Computing on large-scale distributed systems:XtremWeb architecture,programming models,security,tests and convergence with grid[J].Future Generation Computer Systems,2005,21(3):417-437.
  • 5Sonnek J,Nathan M,Weissman J.Reputation-based schedu-ling on unreliable distributed infrastructures[C] ∥Proceedings of the 26th IEEE International Conference on Distributed Computing Systems.Lisboa:IEEE,2006:30-37.
  • 6林伟伟,齐德昱,刘波.基于资源融合的网格任务调度模型与算法[J].华南理工大学学报(自然科学版),2008,36(1):32-37. 被引量:4
  • 7Buyya R,Abramson D,Venugopal S.The grid economy[J].IEEE Special Issue on Grid Computing,2005,93(3):698-714.
  • 8Cohen E,Shenker S.Replication strategies in unstructured peer-to-peer networks[C] ∥Proceedings of the ACM Special Interest Group on Data Communication.Pittsburgh:ACM,2002:177-190.
  • 9Kondo D,Chien A,Casanova H.Resource management for rapid application turnaround on enterprise desktop grids[C] ∥Proceedings of ACM/IEEE Conference on Supercomputing.Pittsburgh:IEEE,2004:17-29.
  • 10何琨,赵勇,黄文奇.基于任务复制的分簇与调度算法[J].计算机学报,2008,31(5):733-740. 被引量:14

二级参考文献23

  • 1林伟伟,齐德昱.树型网格环境TGrid的模型及算法[J].华南理工大学学报(自然科学版),2007,35(1):89-93. 被引量:4
  • 2何琨,赵勇,陈阳.分布式环境下多任务调度问题的分析与求解[J].系统工程理论与实践,2007,27(5):119-125. 被引量:12
  • 3Hall N, Potts C N, Sriskandarajah C. Parallel machine scheduling with a common server [ J ]. Discrete Applied Mathematics, 2000,102 : 223- 243.
  • 4Kravchenko S A, Wemer F. Parallel machine scheduling problems with a single server [ J ]. Mathematical Computational Modelling, 1997,26 : 1-11.
  • 5Cheng Y C, Robertazzi T G. Distributed computation for a tree network with communication delays [ J ]. IEEE Transactions on Aerospace and Electronic Systems, 1990,26 (3) :511-516.
  • 6Veeravalli B, Yao J. Divisible load scheduling strategies on distributed multi-level tree networks with communication delays and buffer constraints [ J]. Computer Communications,2004,27( 1 ) :93-110.
  • 7Beaumont O,Casanova H ,Legrand A ,et al. Scheduling divisible loads on star and tree networks:results and open problems [ J ]. IEEE Transactions on Parallel and Distributed Systems,2005,16 (3) : 207- 218.
  • 8Braun T D, Siegel H J, Beck N. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems [ J ]. Journal of Parallel and Distributed Computing, 2001,61 (6) :810-837.
  • 9Vincenzo D M, Marco M. Sub optimal scheduling in a grid using genetic algorithms [J]. Parallel Computing, 2004,30(5/6) :553-565.
  • 10Casanova H. Simgrid:a toolkit for the simulation of application scheduling [ C ]//Craig A L, Paul P. Proc of the 1 st IEEE/ACM Int'l Syrup on Cluster Computing and Grid. Brisbane: IEEE ,2001:430-437.

共引文献16

同被引文献33

  • 1卢锡城,王怀民,王戟.虚拟计算环境iVCE:概念与体系结构[J].中国科学(E辑),2006,36(10):1081-1099. 被引量:35
  • 2陈滢,王庆波,金滓,等.虚拟化与云计算[M].北京:电子工业出版社,2009.10.
  • 3ETMINANI K, NAGHIBZADEH M. A min-min max-rain selective algorithm for grid task scheduling[A]. 2007 3rd IEEE/IFIP Interna- tional Conference in Central Asia on Intemet, ICI 2007[C]. Tashkent, Uzbekistan, 2007. 1-7.
  • 4PANDA S K, BHOI S K, KHILAR P M. A semi-interquartile min-min max-min (SIM2) approach for grid task scheduling[A]. Proceedings of International Conference on Advances in Computing, ICAdC 2012[C]. Bangalore, Karnataka, India, 2012.415-421.
  • 5WEI X M. Study of ant colony hybrid algorithm in grid task schedul- ing[J]. Advances in Information Sciences and Service Sciences, 2012, 4(15):325-331.
  • 6XU X, HU H, HU N, et al. Cloud task and virtual machine allocation strategy in cloud computing environment[J]. Communications in Computer and Information Science, 2012,345:113-120.
  • 7BARAGLIA R C, GABRIELE D P, PAGANO G. A multi-criteria job scheduling framework for large computing farms[J]. Journal of Com- puter and System Sciences, 2013, 79(2):230-244.
  • 8CHIANG C W. Two novel genetic operators for task matching and scheduling in heterogeneous computing environments[J]. Journal of Intemet Technology, 2012, 13(5):773-784.
  • 9ABBADI I M, RUAN A. Towards trustworthy resource scheduling in clouds[J]. IEEE Transactions on Information Forensics and Security, 2013, 8(6):973-984.
  • 10WAN B T. Qos min-min scheduling strategy[J]. International Journal of Distributed Sensor Networks, 2009, 5(1):13.

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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