Parallel reduction algorithm with communication delay

Shun'ichi Kurino*, Masayoshi Sakakura, Bing Zhang, Yoshiaki Fukazawa

*この研究の対応する著者

研究成果: Paper査読

抄録

Simulation is an application area for which high speed computation is critical. Massive parallel computers have appeared so that it is now possible to execute very large-scale and complicated simulation without sacrificing accuracy and simplifying problems. For a kind of problems in which the computation in each element depends on the data of all the other elements, a completely-connected network is required in order to simulate with high efficiency. However in massive parallel computers, efficient simulation of these problems is difficult to realize. Its cause is due to their network structure. In this paper, a new network topology which solves these problems with high efficiency and a computation method based on the topology are described.

本文言語English
ページ434-439
ページ数6
出版ステータスPublished - 1996 1月 1
外部発表はい
イベントProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China
継続期間: 1996 6月 121996 6月 14

Other

OtherProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN
CityBeijing, China
Period96/6/1296/6/14

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)

フィンガープリント

「Parallel reduction algorithm with communication delay」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル