トップページ |
ログイン
公表論文>
論文>
An All-to-All Personalized Communication Algorithm for Faulty Hypercubes
|
英語タイトル
|
An All-to-All Personalized Communication Algorithm for Faulty Hypercubes
|
|
著者
|
- Hiroshi Masuyama（増山 博）
- Takao Kawamura（川村 尚生）
- Etsuko Masuyama
|
|
論文誌
|
Proceedings of the International Symposium on Performance Evaluation of Computer and Telecommunication Systems
|
|
巻
|
|
|
号
|
|
|
ページ
|
pp. 89-96
|
|
出版年
|
2001年6月
|
|
概要
|
Collective communication involves global data movement and global control among a group of processors in a parallel/distributed computer system. Among all collective communications, all-to-all personalized communication is one of the most dense communication patterns. In this paper, for n-dimensional faulty hypercubes, we propose an all-to-all personalized communication algorithm obtained by extending an all-to-all broadcasting algorithm fault-tolerant in the presence of up to \floor(n/2) faulty nodes. The proposed algorithm assumes a multiport communication and an availability of global fault information. The total time steps required to the algorithm is given as about 5 2^{n-1} in the presence of any multiple fault up to \floor(n/2), that is does not depend on the number of presented faults.
|
|
ファイル
|
BibTeX
|