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
이 편지에서 우리는 다음과 같이 생각합니다. 일대일 방송 WS 또는 PC 클러스터와 같은 메시지 전달을 기반으로 하는 분산 메모리 병렬 컴퓨터에서. 우리는 효율적인 방송 알고리즘을 제시합니다. 겹쳐진 2단계 방송 (O2PB), 이는 다음의 향상된 버전입니다. 2단계 방송 (2PB). O2PB 알고리즘은 다음과 같은 다른 알고리즘과 비교됩니다. 선형 방송, 나무 방송 및 2PB 알고리즘. 우리의 이론적, 실험적 결과에 따르면, 방송되는 메시지의 크기가 클 경우, O2PB 알고리즘은 모든 알고리즘 중에서 가장 빠릅니다. 그만큼 O2PB 알고리즘은 기존 알고리즘보다 약 20% 더 빠릅니다. 2PB 연산.
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.
부
Noritaka SHIGEI, Masahiro KANDA, "Overlapped-Two-Phase Broadcast and Its Evaluation on a Cluster of PCs" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 6, pp. 1039-1042, June 2002, doi: .
Abstract: In this letter, we consider one-to-all broadcast on distributed memory parallel computers based on message-passing, such as cluster of WSs or PCs. We present an efficient broadcast algorithm, called overlapped-two-phase broadcast (O2PB), that is an enhanced version of two-phase broadcast (2PB). The O2PB algorithm is compared with other algorithms, such as linear broadcast, tree broadcast and 2PB algorithms. According to our theoretical and experimental results, when the size of message to be broadcasted is large, the O2PB algorithm is fastest among all the algorithms. The O2PB algorithm is approximately 20% faster than the 2PB algorithm.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_6_1039/_p
부
@ARTICLE{e85-d_6_1039,
author={Noritaka SHIGEI, Masahiro KANDA, },
journal={IEICE TRANSACTIONS on Information},
title={Overlapped-Two-Phase Broadcast and Its Evaluation on a Cluster of PCs},
year={2002},
volume={E85-D},
number={6},
pages={1039-1042},
abstract={In this letter, we consider one-to-all broadcast on distributed memory parallel computers based on message-passing, such as cluster of WSs or PCs. We present an efficient broadcast algorithm, called overlapped-two-phase broadcast (O2PB), that is an enhanced version of two-phase broadcast (2PB). The O2PB algorithm is compared with other algorithms, such as linear broadcast, tree broadcast and 2PB algorithms. According to our theoretical and experimental results, when the size of message to be broadcasted is large, the O2PB algorithm is fastest among all the algorithms. The O2PB algorithm is approximately 20% faster than the 2PB algorithm.},
keywords={},
doi={},
ISSN={},
month={June},}
부
TY - JOUR
TI - Overlapped-Two-Phase Broadcast and Its Evaluation on a Cluster of PCs
T2 - IEICE TRANSACTIONS on Information
SP - 1039
EP - 1042
AU - Noritaka SHIGEI
AU - Masahiro KANDA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2002
AB - In this letter, we consider one-to-all broadcast on distributed memory parallel computers based on message-passing, such as cluster of WSs or PCs. We present an efficient broadcast algorithm, called overlapped-two-phase broadcast (O2PB), that is an enhanced version of two-phase broadcast (2PB). The O2PB algorithm is compared with other algorithms, such as linear broadcast, tree broadcast and 2PB algorithms. According to our theoretical and experimental results, when the size of message to be broadcasted is large, the O2PB algorithm is fastest among all the algorithms. The O2PB algorithm is approximately 20% faster than the 2PB algorithm.
ER -