On Parallel Calculation of All-Terminal Network Reliability

Kirill Sergeev, Denis Migov

Результат исследования: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференциинаучнаярецензирование

Аннотация

The paper presents parallel algorithms for calculating the exact value of all-terminal reliability of a network with unreliable edges and absolutely reliable nodes. A random graph is used as a model of such network. The algorithms are based on the factorization procedure which is a well-known sequential method of a reliability calculation. Parallelization of the algorithms consists in sending subgraphs, arising during the factorization of a network on the master process, to the rest of the processes that perform sequential calculation by the factorization. The basic idea of the parallel algorithms proposed is to distinguish those subgraphs, arising during the factorization in the work processes, that are relatively hard for reliability calculation. These subgraphs are sent back to the master process, which runs the computation of their reliability in a recursive way, i.e. according to the same scheme as with an initial graph. The results of the numerical experiments are given.

Язык оригиналаанглийский
Название основной публикацииProceedings - 2021 17th International Asian School-Seminar "Optimization Problems of Complex Systems", OPCS 2021
ИздательInstitute of Electrical and Electronics Engineers Inc.
Страницы104-107
Число страниц4
ISBN (электронное издание)978-1-6654-0562-1
DOI
СостояниеОпубликовано - 2021
Событие17th International Asian School-Seminar "Optimization Problems of Complex Systems", OPCS 2021 - Moscow, Российская Федерация
Продолжительность: 13 сен 202117 сен 2021

Серия публикаций

НазваниеProceedings - 2021 17th International Asian School-Seminar "Optimization Problems of Complex Systems", OPCS 2021

Конференция

Конференция17th International Asian School-Seminar "Optimization Problems of Complex Systems", OPCS 2021
СтранаРоссийская Федерация
ГородMoscow
Период13.09.202117.09.2021

Предметные области OECD FOS+WOS

  • 1.01 МАТЕМАТИКА

Fingerprint

Подробные сведения о темах исследования «On Parallel Calculation of All-Terminal Network Reliability». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать