Parallel reduction algorithm with communication delay

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

Research output: Contribution to conferencePaper

Abstract

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.

Original languageEnglish
Pages434-439
Number of pages6
Publication statusPublished - 1996 Jan 1
EventProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China
Duration: 1996 Jun 121996 Jun 14

Other

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

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Kurino, S., Sakakura, M., Zhang, B., & Fukazawa, Y. (1996). Parallel reduction algorithm with communication delay. 434-439. Paper presented at Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN, Beijing, China, .