Network Reliability Calculation with Use of GPUs

2021 ◽  
pp. 210-219
Author(s):  
Denis A. Migov ◽  
Tatyana V. Snytnikova ◽  
Alexey S. Rodionov ◽  
Vyacheslav I. Kanevsky
2014 ◽  
Vol 912-914 ◽  
pp. 1690-1694 ◽  
Author(s):  
Yu Fang Shi ◽  
Xiu Fen Wang

System reliability theory is becoming a focus of international management science and system engineering research, though specific studies are still at a starting stage in the field of engineering project management. According to objective system of engineering project, the connotation of construction reliability is defined and based on principle of network reliability, a method of disjointed minimal paths set is proposed and the symbol expression formula is given to calculate construction reliability. This method is proved efficient and accurate by an example and useful try on theory and method research of engineering project system reliability is made.


2014 ◽  
Vol 521 ◽  
pp. 502-507
Author(s):  
Jun Liu ◽  
Jian Su ◽  
Kang Ma ◽  
Hai Tao Liu ◽  
Tao Wei

Distribution network reliability calculation is an important function for distribution network planning and operating system software. It is also one of the earliest core function modules for distribution network calculating. This paper investigates into general-purpose distribution network reliability assessment technique. The paper improves the minimal path method for reliability assessment and solves the precision problem using general-purpose minimal path technique; the paper demonstrates an example to verify the validity of this method.


Author(s):  
Yi-Kuei Lin ◽  
Shin-Guang Chen

The enumeration approaches are important topics in network reliability calculation. For general purposes, the explicit enumeration (EE) is the popular method to apply. However, the low-cost feature of EE sacrifices its efficiency. A great improvement of EE is the invention of fast enumeration (FE), which creates a low-cost way of general purpose enumeration method with very good efficiency for applications. But for the enumeration in network reliability calculation, the optimal number of enumerations can be shown to be [Formula: see text], where [Formula: see text] is the number of minimal paths and [Formula: see text] is the demand of flow. FE still has the complexity far greater than the optimal one. This paper proposes an exact enumeration method for network reliability calculation, which has the complexity no greater than [Formula: see text]. This method greatly improves the enumeration efficiency than FE. So, it is believed to be very valuable to the large real-life applications. Benchmarks are made to show the efficiency of the proposed method.


1997 ◽  
Vol 33 (9) ◽  
pp. 759 ◽  
Author(s):  
Fu-Min Yeh ◽  
Sy-Yen Kuo

Sign in / Sign up

Export Citation Format

Share Document