Parallelization of a Dynamic Unstructured Algorithm Using Three Leading Programming Paradigms

Authors:
Leonid Oliker;Rupak Biswas
Affiliations:
NERSC, Berkeley, CA;Computer Sciences Corp., Moffett Field, CA
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2000

Citing 3
Cited 14

A new procedure for dynamic adaption of three-dimensional unstructured grids

Applied Numerical Mathematics
PLUM: parallel load balancing for adaptive unstructured meshes

Journal of Parallel and Distributed Computing
Multi-processor performance on the Tera MTA

SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing

High-performance Java codes for computational fluid dynamics

Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande
A comparison of three programming models for adaptive applications on the origin2000

Journal of Parallel and Distributed Computing
Memory-Intensive Benchmarks: IRAM vs. Cache-Based Machines

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Message passing and shared address space parallelism on an SMP cluster

Parallel Computing
Performance and modularity benefits of message-driven execution

Journal of Parallel and Distributed Computing
Unstructured adaptive meshes: bad for your memory?

Applied Numerical Mathematics - Adaptive methods for partial differential equations and large-scale computation
Performance of a new CFD flow solver using a hybrid programming paradigm

Journal of Parallel and Distributed Computing
Unstructured adaptive meshes: bad for your memory?

Applied Numerical Mathematics - Adaptive methods for partial differential equations and large-scale computation
Edgepack: a parallel vertex and node reordering package for optimizing edge-based computations in unstructured grids

VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Designing an efficient partitioning algorithm for grid environments with application to N-body problems

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Cost of mutual exclusion with spin locks on multi-core CPUs

BICA'12 Proceedings of the 5th WSEAS congress on Applied Computing conference, and Proceedings of the 1st international conference on Biologically Inspired Computation
High quality real-time image-to-mesh conversion for finite element simulations

Proceedings of the 27th international ACM conference on International conference on supercomputing
High quality real-time Image-to-Mesh conversion for finite element simulations

Journal of Parallel and Distributed Computing
Toward GPU accelerated topology optimization on unstructured meshes

Structural and Multidisciplinary Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 popular 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) feature of the Origin2000, and a multithreaded version on the newly released Tera Multithreaded Architecture (MTA). We compare several critical factors of this parallel code development, including runtime, scalability, programmability, portability, and memory overhead. Our overall results demonstrate that multithreaded systems offer tremendous potential for quickly and efficiently solving some of the most challenging real-life problems on parallel computers.