【24h】

Faster Exact Reliability Computation

机译:更快的精确可靠性计算

获取原文

摘要

High reliability guarantees are a prerequisite for any critical infrastructure. In complex systems, the computation of the probability to provide a service is difficult and hence time consuming. To this end, this article presents an improved method for exact reliability computation by exploiting the existence of articulation points in graphs representing the dependency function such systems. Evaluated on generalized block graphs with many articulation points, this method provides a speed-up of 50% to 85% in general. When the network does not contain articulation points, the overhead in memory and computation time is negligible in comparison to an existing method.
机译:高可靠性保证是任何关键基础架构的先决条件。在复杂的系统中,提供服务的概率的计算很困难,因此很费时间。为此,本文提出了一种改进的方法,通过利用表示此类系统的依赖函数的图形中的铰接点,来进行精确的可靠性计算。通过对具有许多铰接点的广义框图进行评估,该方法通常可以将速度提高50%至85%。当网络不包含连接点时,与现有方法相比,内存和计算时间的开销可以忽略不计。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号