Parallelization of a dynamic unstructured algorithm using three leading programming paradigms
The success of parallel computing in solving real-life computationally intensive problems relies on their efficient mapping and execution on large-scale multiprocessor architectures. Many important applications are both unstructured and dynamic in nature, making their efficient parallel implementation a daunting task. This paper presents the parallelization of a dynamic unstructured mesh adaptation algorithm using three programming paradigms on three leading supercomputers. We examine an MPI message passing implementation on the Cray T3E and the SGI Origin2000, a shared-memory implementation using the cache coherent nonuniform memory access (CC-NUMA) of the Origin2000, and a multithreaded version on the newly released TeraMultithreaded Architecture (MTA). We compare the critical factors of this parallel code development, including runtime, scalability, programmability, and memory overhead. Our overall results demonstrate that multithreaded systems offers a tremendous potential for quickly and efficiently solving some of the most challenging real-life problems on parallel computers.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director, Office of Science. Office of Advanced Scientific Computing Research. Mathematical, Information, and Computational Sciences Division (US)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 776615
- Report Number(s):
- LBNL-46243; R&D Project: 618110; TRN: AH200118%%453
- Journal Information:
- IEEE Transactions on Parallel and Distributed Systems, Vol. 11, Issue 9; Other Information: Journal Publication Date: Sept. 2000; PBD: 26 Jun 2000
- Country of Publication:
- United States
- Language:
- English
Similar Records
Experience with mixed MPI/threaded programming models
P-HARP: A parallel dynamic spectral partitioner