Domain decomposition and locality optimization for large-scale lattice Boltzmann simulations

Details Domain decomposition and locality optimization for large-scale lattice Boltzmann simulations Domain decomposition and locality optimization for large-scale lattice Boltzmann simulations

2011-11-04

arxiv.org/abs/1111.1129v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We present a simple, parallel and distributed algorithm for setting up and partitioning a sparse representation of a regular discretized simulation domain. This method is scalable for a large number of processes even for complex geometries and ensures load balance between the domains, reasonable communication interfaces, and good data locality within the domain. Applying this scheme to a list-based lattice Boltzmann flow solver can achieve similar or even higher flow solver performance than widely used standard graph partition based tools such as METIS and PT-SCOTCH.

Affiliated with

Also associated with

No associations

Rating

Domain decomposition and locality optimization for large-scale lattice Boltzmann simulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Domain decomposition and locality optimization for large-scale lattice Boltzmann simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domain decomposition and locality optimization for large-scale lattice Boltzmann simulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-101061