Presentation is loading. Please wait.

Presentation is loading. Please wait.

Improving the Performance of Large-Scale Unstructured PDE Applications

Published byRadim Kubíček Modified over 5 years ago

Similar presentations

Presentation on theme: "Improving the Performance of Large-Scale Unstructured PDE Applications"— Presentation transcript:

1 Improving the Performance of Large-Scale Unstructured PDE Applications
Xing Cai Simula Research Lab Norway June 18, 2004

2 How can parallel PDE solvers avoid overhead due to duplicated local computations?
Overlapping DD methods may involve duplicated local computations Needed is a catagorization of the overlapping mesh points Improved parallel performance is achievable

3 Overlapping DD methods are important parallel PDE solvers
Overlapping zones exist between neighbornig subdomains, sharing some mesh points => overhead

4 Avoiding overhead due to duplicated local computations needs a “categorization”
A disjoint distribution of all the overlapping points Re-order the mesh points on each subdomain Replace “work” on certain points with communication

5 Improved parallel performance arises from removing duplicated local computations
Fewer points participate in local computations A slight increase of communication volume Sequential software is easily re-usable

Download ppt "Improving the Performance of Large-Scale Unstructured PDE Applications"

Similar presentations

FEMLAB Conference Stockholm 2005 UNIVERSITY OF CATANIA Department of Industrial and Mechanical Engineering Authors : M. ALECCI, G. CAMMARATA, G. PETRONE.

FEMLAB Conference Stockholm 2005 UNIVERSITY OF CATANIA Department of Industrial and Mechanical Engineering Authors : M. ALECCI, G. CAMMARATA, G. PETRONE.
Parallel Solution of Navier Stokes Equations Xing Cai Dept. of Informatics University of Oslo.

Parallel Solution of Navier Stokes Equations Xing Cai Dept. of Informatics University of Oslo.
Unstructured Data Partitioning for Large Scale Visualization CSCAPES Workshop June, 2008 Kenneth Moreland Sandia National Laboratories Sandia is a multiprogram.

Unstructured Data Partitioning for Large Scale Visualization CSCAPES Workshop June, 2008 Kenneth Moreland Sandia National Laboratories Sandia is a multiprogram.
Data Locality Aware Strategy for Two-Phase Collective I/O. Rosa Filgueira, David E.Singh, Juan C. Pichel, Florin Isaila, and Jesús Carretero. Universidad.

Data Locality Aware Strategy for Two-Phase Collective I/O. Rosa Filgueira, David E.Singh, Juan C. Pichel, Florin Isaila, and Jesús Carretero. Universidad.
Performance Metrics Parallel Computing - Theory and Practice (2/e) Section 3.6 Michael J. Quinn mcGraw-Hill, Inc., 1994.

Performance Metrics Parallel Computing - Theory and Practice (2/e) Section 3.6 Michael J. Quinn mcGraw-Hill, Inc., 1994.
Some Geometric integration methods for PDEs Chris Budd (Bath)

Some Geometric integration methods for PDEs Chris Budd (Bath)
Virtues of Good (Parallel) Software

Virtues of Good (Parallel) Software
Tools for Multi-Physics Simulation Hans Petter Langtangen Simula Research Laboratory Oslo, Norway Department of Informatics, University of Oslo.

Tools for Multi-Physics Simulation Hans Petter Langtangen Simula Research Laboratory Oslo, Norway Department of Informatics, University of Oslo.
computer

computer
Scaling Area Under a Curve. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.

Scaling Area Under a Curve. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.
A Software Strategy for Simple Parallelization of Sequential PDE Solvers Hans Petter Langtangen Xing Cai Dept. of Informatics University of Oslo.

A Software Strategy for Simple Parallelization of Sequential PDE Solvers Hans Petter Langtangen Xing Cai Dept. of Informatics University of Oslo.
CS 484 Designing Parallel Algorithms Designing a parallel algorithm is not easy. There is no recipe or magical ingredient Except creativity We can benefit.

CS 484 Designing Parallel Algorithms Designing a parallel algorithm is not easy. There is no recipe or magical ingredient Except creativity We can benefit.
Motivation: Sorting is among the fundamental problems of computer science. Sorting of different datasets is present in most applications, ranging from.

Motivation: Sorting is among the fundamental problems of computer science. Sorting of different datasets is present in most applications, ranging from.
Domain Decomposition in High-Level Parallelizaton of PDE codes Xing Cai University of Oslo.

Domain Decomposition in High-Level Parallelizaton of PDE codes Xing Cai University of Oslo.
Electronic visualization laboratory, university of illinois at chicago Visualizing Very Large Scale Earthquake Simulations (SC 2003) K.L.Ma, UC-Davis.

Electronic visualization laboratory, university of illinois at chicago Visualizing Very Large Scale Earthquake Simulations (SC 2003) K.L.Ma, UC-Davis.
Bivariate Data Parallel Boxplots. Parallel boxplots are made up of several regular boxplots. They are drawn up on a common scale so they can be easily.

Bivariate Data Parallel Boxplots. Parallel boxplots are made up of several regular boxplots. They are drawn up on a common scale so they can be easily.
An Object-Oriented Software Framework for Building Parallel Navier-Stokes Solvers Xing Cai Hans Petter Langtangen Otto Munthe University of Oslo.

An Object-Oriented Software Framework for Building Parallel Navier-Stokes Solvers Xing Cai Hans Petter Langtangen Otto Munthe University of Oslo.
Scaling Conway’s Game of Life. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.

Scaling Conway’s Game of Life. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.
On the Performance of PC Clusters in Solving Partial Differential Equations Xing Cai Åsmund Ødegård Department of Informatics University of Oslo Norway.

On the Performance of PC Clusters in Solving Partial Differential Equations Xing Cai Åsmund Ødegård Department of Informatics University of Oslo Norway.
HYDROGRID J. Erhel – October 2004 Components and grids  Deployment of components  CORBA model  Parallel components with GridCCM Homogeneous cluster.

HYDROGRID J. Erhel – October 2004 Components and grids  Deployment of components  CORBA model  Parallel components with GridCCM Homogeneous cluster.

Similar presentations

Ads by Google