Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-06-16
Computer Science
Distributed, Parallel, and Cluster Computing
16 pages, 10 figures
Scientific paper
Bandwidth-starved multicore chips have become ubiquitous. It is well known that the performance of stencil codes can be improved by temporal blocking, lessening the pressure on the memory interface. We introduce a new pipelined approach that makes explicit use of shared caches in multicore environments and minimizes synchronization and boundary overhead. Benchmark results are presented for three current x86-based microprocessors, showing clearly that our optimization works best on designs with high-speed shared caches and low memory bandwidth per core. We furthermore demonstrate that simple bandwidth-based performance models are inaccurate for this kind of algorithm and employ a more elaborate, synthetic modeling procedure. Finally we show that temporal blocking can be employed successfully in a hybrid shared/distributed-memory environment, albeit with limited benefit at strong scaling.
Hager Georg
Treibig Jan
Wellein Gerhard
Wittmann Markus
No associations
LandOfFree
Leveraging shared caches for parallel temporal blocking of stencil codes on multicore processors and clusters 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 Leveraging shared caches for parallel temporal blocking of stencil codes on multicore processors and clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Leveraging shared caches for parallel temporal blocking of stencil codes on multicore processors and clusters will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-100145