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 language | English |
|---|---|
| Title of host publication | Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN |
| Place of Publication | Los Alamitos, CA, United States |
| Publisher | IEEE |
| Pages | 434-439 |
| Number of pages | 6 |
| Publication status | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China Duration: 1996 Jun 12 → 1996 Jun 14 |
Other
| Other | Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN |
|---|---|
| City | Beijing, China |
| Period | 96/6/12 → 96/6/14 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
Cite this
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 proceeding › Conference contribution
}
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
AN - SCOPUS:0029707494
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 -