The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A abordagem SDP (Soma de Produtos Disjuntos) é uma técnica bem conhecida para calcular medidas de confiabilidade de redes. Até agora vários algoritmos foram desenvolvidos com base nesta abordagem. Nesta carta, apresentamos uma estrutura geral para paralelização desses algoritmos SDP. Com base no framework, implementamos uma versão paralela de um algoritmo SDP denominado CAREL em uma rede de estações de trabalho. Resultados experimentais mostram que funciona razoavelmente bem com acelerações quase lineares.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Tatsuhiro TSUCHIYA, Tomoya KAJIKAWA, Tohru KIKUNO, "Parallelizing SDP (Sum of Disjoint Products) Algorithms for Fast Reliability Analysis" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 5, pp. 1183-1186, May 2000, doi: .
Abstract: The SDP (Sum of Disjoint Products) approach is a well-known technique for computing network reliability measures. So far several algorithms have been developed based on this approach. In this letter, we present a general framework for parallelization of these SDP algorithms. Based on the framework, we implemented a parallel version of an SDP algorithm called CAREL on a network of workstations. Experimental results show that it works fairly well with almost linear speedups.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_5_1183/_p
Copiar
@ARTICLE{e83-d_5_1183,
author={Tatsuhiro TSUCHIYA, Tomoya KAJIKAWA, Tohru KIKUNO, },
journal={IEICE TRANSACTIONS on Information},
title={Parallelizing SDP (Sum of Disjoint Products) Algorithms for Fast Reliability Analysis},
year={2000},
volume={E83-D},
number={5},
pages={1183-1186},
abstract={The SDP (Sum of Disjoint Products) approach is a well-known technique for computing network reliability measures. So far several algorithms have been developed based on this approach. In this letter, we present a general framework for parallelization of these SDP algorithms. Based on the framework, we implemented a parallel version of an SDP algorithm called CAREL on a network of workstations. Experimental results show that it works fairly well with almost linear speedups.},
keywords={},
doi={},
ISSN={},
month={May},}
Copiar
TY - JOUR
TI - Parallelizing SDP (Sum of Disjoint Products) Algorithms for Fast Reliability Analysis
T2 - IEICE TRANSACTIONS on Information
SP - 1183
EP - 1186
AU - Tatsuhiro TSUCHIYA
AU - Tomoya KAJIKAWA
AU - Tohru KIKUNO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2000
AB - The SDP (Sum of Disjoint Products) approach is a well-known technique for computing network reliability measures. So far several algorithms have been developed based on this approach. In this letter, we present a general framework for parallelization of these SDP algorithms. Based on the framework, we implemented a parallel version of an SDP algorithm called CAREL on a network of workstations. Experimental results show that it works fairly well with almost linear speedups.
ER -