Name
Abstract | ||
|---|---|---|
In this work a novel strategy for solving the n-body problem in parallel is presented. Our method, named slice classification, not only extracts the maximum available parallelism, but also it increases data locality. Results on a SGI O2000 validate the efficiency of our proposal as compared with other well-know methods. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-24669-5_42 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
n body problem | Locality,Computer science,Load balancing (computing),Parallel computing | Conference |
Volume | ISSN | Citations |
3019 | 0302-9743 | 3 |
PageRank | References | Authors |
0.52 | 6 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David E. Singh | 1 | 191 | 23.13 |
| María J. Martín | 2 | 174 | 27.68 |
| Francisco F. Rivera | 3 | 177 | 26.17 |
| DE Singh | 4 | 3 | 0.52 |
| MJ Martin | 5 | 3 | 0.52 |
| FF Rivera | 6 | 3 | 0.52 |