期刊文献+

面向服务仿真系统的最大可靠性容错调度算法 被引量:2

Fault-tolerant Scheduling Algorithm for Maximizing Reliability of Service-Oriented Simulation System
下载PDF
导出
摘要 基于PB模型对面向服务的分布式仿真系统的容错调度问题进行了研究。首先,根据该类系统的特点提出了两个命题并以此为基础给出了仿真任务的调度规则;其次,分析了仿真任务的可靠性代价并给出了任务最坏反应时间的计算公式;最后,在此基础上提出了相应的算法RC-RTFT和MW-RTFT。RC-RTFT综合利用了最小可靠性代价及最小最坏反应时间两种启发式规则进行主版本任务的调度,MW-RTFT则基于最小最坏反应时间这一启发式规则进行主版本任务的调度,副版本任务的调度都是基于最小最坏反应时间启发式规则进行。算法仿真结果表明RC-RTFT算法具有较好的负载平衡特性和稳定性,且较MW-RTFT具有更小的算法复杂度。 The real-time fault-tolerant scheduling problem of service-oriented distributed simulation system was studied based on PB model, in which the heterogeneity of system was considered. Firstly, two propositions were put forward according to the characters of simulation system and corresponding scheduling rules were given. Secondly, reliability cost of simulation task was analyzed and two formulas for counting the worst case response time of primary and backup version tasks were put forward. Finally, two different algorithms were advanced, RC-RTFT and MW-RTFT. Primary version tasks were scheduled by the integration rule of minimum reliability cost and minimum worst case response time heuristic rule in RC-RTFT, whereas in MW-RTFT which were scheduled by minimum worst case response time. And in both algorithms, backup version tasks were scheduled by minimum worst case response time heuristic rule. The simulation result of algorithms shows that the load balance and stability characteristic of RC-RTFT is acceptable, and as computation complexity considered, and RC-RTFT is better than MW-RTFT.
出处 《系统仿真学报》 CAS CSCD 北大核心 2009年第7期1816-1821,共6页 Journal of System Simulation
基金 国防预研基金(51404010403KG0155)
关键词 面向服务的分布式仿真系统 容错 容错调度 可靠性代价 service oriented distributed simulation fault-tolerance PB model real-time scheduling reliability cost
  • 相关文献

参考文献17

  • 1D Bmtzman, M Zyda, J M PuUen, et al. Extensible Modeling and Simulation Framework (XMSF): Challenges for Web-based Modeling and Simulation. XMSF Workshop and Symposium Report [EB/OL]. (2002) [2007]. http://www. Moveslnstitute.org/xmsf.
  • 2张童,刘云生,查亚兵.可组合仿真系统的概念框架研究[J].系统仿真学报,2007,19(8):1710-1712. 被引量:7
  • 3徐伟,金蓓弘,李京,曹建农.一种基于移动Agent的复合Web服务容错模型[J].计算机学报,2005,28(4):558-567. 被引量:11
  • 4Stmondo Ghosh, Rami Melhern, Daniel Mosse. Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (S1045-9219), 1997, 8(3): 272-284.
  • 5Martin Eklof, Farshad Moradi, Rassul Ayani. A Framework for Fault-tolerance in HLA-Based Distributed Simulations [C]//M E Kuhl, N M Steiger. F B Armstrong, J A Joines, ed. Proceedings of the 2005 Winter Simulation Conference. Orlando, USA: IEEE Press, 2005: 1182-1189.
  • 6Moller B, M Karlsson, B Lofstrand. Developing fault tolerant federations using HLA evolved [C]// Proceedings of the 2005 Spring Simulation Interoperability Workshop. San Diego, USA:http://www.sisostds.org/siw/05 spring/readlist.htm, 05S-SIW-048.
  • 7Ching-Chih Han, Kang G Shin, Jian Wu. A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults [J]. IEEE TRANSACTIONS ON COMPUTERS (S0018-9340), 2003, 52(3): 362-372.
  • 8G Manimaran, C Siva Ram Murthy. A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (S 1045 -9219), 1998, 9(11 ): 1137-1152.
  • 9Ismael Ripoll, Alfons Crespo, Ana Garcia-Fomes. An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING (S0098-5589), 1996, 23(6): 388-400.
  • 10S Kartik, Siva Ram Murthy. Task Allocation Algorithms for Maximizing Reliability of Distributed Computing Systems [J]. IEEE TRANSACTIONS ON COMPUTERS (S0018-9340), 1997, 46(6): 719-724.

二级参考文献51

  • 1张童,刘云生,张传富,查亚兵.开放网格服务体系结构OGSA及其仿真应用[J].计算机仿真,2004,21(9):105-108. 被引量:3
  • 2刘云生,查亚兵,张传富,张童,黄柯棣.分布式仿真系统容错机制研究[J].系统仿真学报,2005,17(2):355-357. 被引量:10
  • 3Elnozahy M, Alvisi L, Wang Y M,et al. A Survey of Rollback-Recovery Protocols in Message-Passing Systems[R]. Tech. Rep. No. CMU-CS-96-181, Dept. of Computer Science, Carnegie Mellon Univ, ftp://ftp.cs.cmu.edu/user/mootaz/papers/S.ps,1996.
  • 4Fleischmann J, Wilsey P A. Comparative Analysis of Periodic State Saving Techniques in Time Warp Simulators[A]. In Proceedings of the 9th Workshop on Parallel and Distributed Simulation(PADS'95)[C],Lake Placid, NY, USA, June 14-16, 1995, 50-58.
  • 5Vaidya N H. A Case for Two-level Distributed Recovery Schemes[A]. In ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems[C], Ottawa, May 1995.
  • 6Vaidya N H. A Case for Two-Level Recovery Schemes[J]. IEEE Transactions on Computers, 47(6),1998.
  • 7Park Gyung-Leen, Youn Hee Yong, Choo Hyun-Seung. Optimal Checkpoint Interval Analysis Using Stochastic Petri Net[A]. 2001 Pacific Rim International Symposium on Dependable Computing[C],December 17-19, Seoul, Korea,2001.
  • 8Trivedi K S. Probability and Statistics with Reliablility, Queueing and Computer Science Applications[M]. Prentice Hall, 1988.
  • 9Austin D., Barbir A., Ferris C., Garg S. eds. Web service rrchitecture requirements. World Wide Web Consortium, Technical Report TR/2004/NOTE-wsa-reqs -20040211, 2004
  • 10Leavitt N. Are Web services finally ready to deliver? IEEE Computer, 2004, 37(11):14~18

共引文献61

同被引文献22

  • 1景维鹏,吴智博,刘宏伟,董剑.支持优先级约束任务的容错调度算法[J].清华大学学报(自然科学版),2011,51(S1):1440-1444. 被引量:4
  • 2韩建军,李庆华,Abbas A.Essa.基于软件容错的动态实时调度算法[J].计算机研究与发展,2005,42(2):315-321. 被引量:13
  • 3郭辉,王智广,周敬利.异构分布式系统中基于负载均衡的容错调度算法[J].计算机学报,2005,28(11):1807-1816. 被引量:17
  • 4Lui Sha, Tarek Abdelzaher, Karl-erik Arzen, et al. Real Time Scheduling Theory: A Historical Perspective [J]. Real-Time Systems Journal (S0922-6443), 2004, 28(2-3): 101-155.
  • 5G Lima. Fault-Tolerance in Fixed-Priority Hard Real-Time Distributed Systems [D]. York, England: University of York, 2003.
  • 6S Punnekkat. Schedulability Analysis for Fault-Tolerant Real-Time Systems [D]. York, England: University of York, 1997.
  • 7Ching-Chih Hart, Kang G Shin, Jian Wu. A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults [J]. IEEE Transactions on Computers (S0018-9340), 2003, 52(3): 362-372.
  • 8Y Wang. M Saksena. Scheduling fixed-priority tasks with preemption threshold [C]// Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications. USA: IEEE Computer Society Press, 1999: 328-335.
  • 9J Regehr. Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults [C]// Proceedings of IEEE Real-Time Systems Symposium, Texas. USA: IEEE Computer Society Press, 2002:315-326.
  • 10Chen Jiong xiong. Extensions to Fixed Priority with Preemption Threshold and Reservation-Based Scheduling [D]. Waterloo, Canada: University of Waterloo, 2005.

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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