A comparison of three programming models for adaptive applications on the Origin2000

Journal of Parallel and Distributed Computing

Volumn 62, Issue 2, 2002, Pages 241-266

  Shan, Hongzhang ^a   Singh, Jaswinder Pal ^a   Oliker, Leonid ^b   Biswas, Rupak ^c  

^a Princeton University   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^c NASA AMES RESEARCH CENTER   (United States)

Author keywords

Dynamic mesh adaptation; Message passing; N body problem; Parellel programming; Shared address space

Indexed keywords

EID: 0036195435     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2001.1777     Document Type: Article

References (24)

1. A comparison of shared and nonshared memory models of parallel computation
2. A hierarchical O(N log N) force-calculation algorithm
3. A new procedure for dynamic adaption of three-dimensional unstructured grids
4. A performance study of cosmological simulations on message-passing and shared-memory multiprocessors
5. "ParMETIS: Parallel graph partitioning and sparse matrix ordering"
6. Parallel multilevel k-way partitioning scheme for irregular graphs
7. Experiences with parallel N-body simulation
8. Tradeoffs in message passing and shared memory implementations of a standard cell router
9. On the influence of programming models on shared memory computer performance
10. PLUM: Parallel load balancing for adaptive unstructured meshes
11. Parallelization of a dynamic unstructured algorithm using three leading programming paradigms
12. Parallel tetrahedral mesh adaptation with dynamic load balancing
13. Ordering unstructured meshes for sparse matrix computations on leading parallel systems
14. "Iterative Methods for Sparse Linear Systems"
15. "Parallel Hierarchical N-body Methods"
16. A comparison of MPI, SHMEM and cache-coherent shared address space programming models on a tightly-coupled multiprocessor
17. Parallel sorting on cache-coherent DSM multiprocessors
18. Parallel visualization algorithms: Performance and architectural implications
19. Implications of hierarchical N-body methods for multiprocessor architectures
20. Load balancing and data locality in adaptive hierarchical N-body methods: Barnes-Hut, fast multipole, and radiosity
21. "Aztec: A massively parallel iterative solver library for solving sparse linear systems"
22. "Jostle: Parallel graph/mesh partitioning and load-balancing software"
23. Performance of dynamic load balancing algorithms for unstructured mesh calculations
24. The SPLASH-2 programs: Characterization and methodological considerations