期刊文献+

具有失效恢复机制的云资源调度算法 被引量:4

Cloud resource scheduling algorithm with failure recovery mechanism
下载PDF
导出
摘要 针对云服务可靠性较低的问题,提出一种考虑节点失效恢复机制的任务调度模型.该模型引入失效恢复机制分析节点的行为特性,将节点间的交互失效划分为可恢复失效和不可恢复失效.参考社会学的人际关系信任模型,通过量化和评估失效恢复机制下节点的可信程度,建立更加符合实际的云服务可靠性模型,并允许资源节点自行调节失效恢复次数限制和失效恢复率.将节点的可信度并入DLS算法得到考虑失效恢复机制的动态级调度(FR-DLS)算法.FR-DLS算法在计算调度级别时充分考虑服务资源的可信程度,使应用任务能够被有效地分配到可信资源节点上.为了评估所提出的算法,在PlanetLab环境中设计基于CloudSim的仿真实验平台,分析及仿真实验结果表明:所提出的FR-DLS算法在牺牲较少的任务完成时间和调度长度的前提下,能够有效地提高云环境下执行任务的成功率;当云环境中的资源节点数和应用任务数不断增加时,该算法在可靠性方面所提升的性能远高于其在任务完成时间和调度长度代价方面所提升的性能,充分体现了其在大规模云环境下的实用性. A task scheduling model with fault recovery mechanism was proposed aimed at the problem of low reliability in Cloud service. The behavior characteristic of nodes was analyzed by using failure recovery mechanism, and the interaction failures between nodes were classified into two categories, including unrecoverable failures and recoverable failures. A more practical Cloud service reliability model was proposed through quantifying and evaluating the trustworthiness of computing nodes by referring to the social trust relationship. The constraints on the numbers of recoveries performed and the recoverability probability could be adjusted freely by resource owners. A dynamic level scheduling (DI.S) algorithm considering fault recovery mechanism named FR-DLS was proposed by integrating the trustworthiness of the nodes into the existing DLS algorithm. The FR-DLS algorithm takes the Cloud service resources' trust degree into account when calculating the scheduling-level of task-resource pairs. Accordingly, the tasks could be executed on trust nodes efficiently. A simulation platform based on CloudSim in PlanetLab was developed in order to evaluate the proposed algorithm. The theoretical analyses and simulation experimental results prove that the proposed FR-DLS algorithm can efficiently improve the mission success rate in cloud environment at the expense of relatively fewer execution time and scheduling length. With the increasing number of nodes and tasks, the increased performance in reliability is much higher than that in the cost of execution time and scheduling length, verifying the practicability in large-scale Cloud environment.
出处 《浙江大学学报(工学版)》 EI CAS CSCD 北大核心 2015年第12期2305-2315,共11页 Journal of Zhejiang University:Engineering Science
基金 国家自然科学青年基金项目(61402005)
关键词 云计算 贝叶斯估计 信任关系 可信度 失效恢复机制 Cloud computing Bayesian estimation trust relationship trustworthiness failure recoverymechanism
  • 相关文献

参考文献32

  • 1BUYYA R, YEO C S. VENUGOPAL S, et al. Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility [J].Future Generation Computer Systems, 2009,25 (6) : 599 - 616.
  • 2DARBHA S, AGRAWAL D P. Optimal scheduling al gorithm for distributed memory machines [J]. Iggg Transactions on Parallel and Distributed Systems, 2002, 9(1): 87-95.
  • 3LEE Y C, ZOMAYA A Y. A novel state transition method for metaheuristic based scheduling in heteroge neous computing systems [J]. IEEE Transactions on Par- allel and Distributed Systems, 2008, 19 (9) :1215-1223.
  • 4ZHU D, MOSSE D, MELHEM R. Power-aware sched- uling for and/or graphs in real time systems [J]. IEEE Transactions on Parallel and Distributed Systems, 2004, 15(9) : 849-864.
  • 5KIM K H, BUYYA R, KIM J. Power aware scheduling of bag-of-tasks applications with deadline constraints on DVS-enabled clusters [C] // Proceedings of the 7th IEEE International Symposium on Cluster Computing and the Grid. Rio de janeiro: IEEE, 2007:541 - 548.
  • 6BUNDE D P. Power-aware scheduling for makespan and flow [J]. Journal of Scheduling, 2009, 12 (5) :489 - 500.
  • 7李茂胜,杨寿保,付前飞,杨锦.基于赔偿的网格资源交易模型[J].软件学报,2006,17(3):472-480. 被引量:9
  • 8XUBM, ZHAO C Y, HUE Z, et al. Job scheduling algorithm based on Berger model in cloud environment [J]. Advances in Engineering Software, 2011, 42 (3) : 419 -425.
  • 9BUYYA R, MURSHED M M, ABRAMSON D, et al. Scheduling parameter sweep applications on global grids: a deadline and budget constrained cost-time opti mization algorithm [J]. Software Practice and Experi- ence, 2005, 35(5): 491-512.
  • 10BLANCO C V, HUEDO E, MONTERO R S, et al. Dynamic provision of computing resources from grid in- frastructures and cloud providers [C] // Grid and Per- vasive Computing Conference, Geneva: IEEE, 2009: 113 - 120.

二级参考文献11

  • 1Foster I,Kesselman C,Tuecke S.The anatomy of the grid:Nabling scalable virtual organizations.Int'l Journal of High Performance Computing Applications,2001,15(3):200-222.
  • 2Sutherland IE.A futures market in computer time.Communications of the ACM,1968,11(6):449-451.
  • 3Ferguson D,Yemini Y,Nikolaou C.Microeconomic algorithms for load balancing in distributed computer systems.In:Proc.of the 8th Int'l Conf.on Distributed Systems.San Jose:IEEE Press,1988.491-499.
  • 4Subramoniam K,Maheswaran M,Toulouse M.Towards a micro-economic model for resource allocation in grid computing systems.In:Proc.of the 2002 IEEE Canadian Conf.on Electrical and Computer Engineering.Manitoba:IEEE Press,2002.782-785.
  • 5Gomoluch J,Schroeder M.Market-Based resource allocation for grid computing:A model and simulation.In:Endler M,Schmidt D,eds.Proc.of the 1st Int'l Workshop on Middleware for Grid Computing (MGC 2003).Rio de Janeiro:Springer-Verlag,2003.211-218.
  • 6Regev O,Nisan N.The popcorn market-An online market for computational resources.In:Proc.of the 1st Int'l Conf.on Information and Computation Economies.Charleston:ACM Press,1998.148-157.
  • 7Buyya R.Economic-Based distributed resource management and scheduling for grid computing[Ph.D.Thesis].Melbourne:Monash University,2002.
  • 8Resnick P,Zeckhauser R.Trust among strangers in Internet transactions:Empirical analysis of eBay's reputation system.In:Working Paper for the NBER Workshop on Empirical Studies of Electronic Commerce.2001.
  • 9Cornelli F,Damiani E,Vimercati S,Paraboschi S,Samarati P.Choosing reputable servents in a P2P network.In:Lassner D,ed.Proc.of the 11th Int'l WWW Conf.Hawaii:ACM Press,2002.376-386.
  • 10Kamvar S,Schlosser M,Garcia-Molina M.The Eigen Trust algorithm for reputation management in P2P networks.In:Proc.of the 12th WWW Conf.Budapest:ACM Press,2003.640-651.

共引文献8

同被引文献38

引证文献4

二级引证文献26

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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