Efficient multicore-aware parallelization strategies for iterative stencil computations

Computer Science – Performance

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, 10 figures

Scientific paper

10.1016/j.jocs.2011.01.010

Stencil computations consume a major part of runtime in many scientific simulation codes. As prototypes for this class of algorithms we consider the iterative Jacobi and Gauss-Seidel smoothers and aim at highly efficient parallel implementations for cache-based multicore architectures. Temporal cache blocking is a known advanced optimization technique, which can reduce the pressure on the memory bus significantly. We apply and refine this optimization for a recently presented temporal blocking strategy designed to explicitly utilize multicore characteristics. Especially for the case of Gauss-Seidel smoothers we show that simultaneous multi-threading (SMT) can yield substantial performance improvements for our optimized algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Efficient multicore-aware parallelization strategies for iterative stencil computations 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 Efficient multicore-aware parallelization strategies for iterative stencil computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient multicore-aware parallelization strategies for iterative stencil computations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-186256

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.