Parallel reduction algorithm with communication delay

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Place of PublicationLos Alamitos, CA, United States
PublisherIEEE
Pages434-439
Number of pages6
Publication statusPublished - 1996
Externally publishedYes
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

Communication
Topology

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Kurino, S., Sakakura, M., Zhang, B., & Fukazawa, Y. (1996). Parallel reduction algorithm with communication delay. In Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN (pp. 434-439). Los Alamitos, CA, United States: IEEE.

Parallel reduction algorithm with communication delay. / Kurino, Shun'ichi; Sakakura, Masayoshi; Zhang, Bing; Fukazawa, Yoshiaki.

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. Los Alamitos, CA, United States : IEEE, 1996. p. 434-439.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kurino, S, Sakakura, M, Zhang, B & Fukazawa, Y 1996, Parallel reduction algorithm with communication delay. in Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. IEEE, Los Alamitos, CA, United States, pp. 434-439, Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN, Beijing, China, 96/6/12.
Kurino S, Sakakura M, Zhang B, Fukazawa Y. Parallel reduction algorithm with communication delay. In Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. Los Alamitos, CA, United States: IEEE. 1996. p. 434-439
Kurino, Shun'ichi ; Sakakura, Masayoshi ; Zhang, Bing ; Fukazawa, Yoshiaki. / Parallel reduction algorithm with communication delay. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. Los Alamitos, CA, United States : IEEE, 1996. pp. 434-439
@inproceedings{f35f69a4e87448a6b8a3a39a53b7f8ef,
title = "Parallel reduction algorithm with communication delay",
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.",
author = "Shun'ichi Kurino and Masayoshi Sakakura and Bing Zhang and Yoshiaki Fukazawa",
year = "1996",
language = "English",
pages = "434--439",
booktitle = "Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN",
publisher = "IEEE",

}

TY - GEN

T1 - Parallel reduction algorithm with communication delay

AU - Kurino, Shun'ichi

AU - Sakakura, Masayoshi

AU - Zhang, Bing

AU - Fukazawa, Yoshiaki

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029707494&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029707494&partnerID=8YFLogxK

M3 - Conference contribution

SP - 434

EP - 439

BT - Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

PB - IEEE

CY - Los Alamitos, CA, United States

ER -