An efficient parallel algorithm for O( N2) direct summation method and its variations on distributed-memory parallel machines
We present a novel, highly efficient algorithm to parallelize O( N 2) direct summation method for N-body problems with individual timesteps on distributed-memory parallel machines such as Beowulf clusters. Previously known algorithms, in which all processors have complete copies of the N-body system...
Uložené v:
| Vydané v: | New astronomy Ročník 7; číslo 7; s. 373 - 384 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.10.2002
|
| Predmet: | |
| ISSN: | 1384-1076, 1384-1092 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!