Load Balancing Regular Meshes on SMPS with MPI

Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors (now cores). However, these strategies often do not consider the inherent system noise which can hinder MPI application scalability to emerging peta-scale machines with 10000+ nodes. In this work, we suggest a solution that uses a tunable hybrid static/dynamic scheduling strategy that can be incorporated into current MPI implementations of mesh codes. By applying this strategy to a 3D jacobi algorithm, we achieve performance gains of at least 16% for 64 SMP nodes.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Kale, Vivek

Contributors dc:contributor

• Gropp, William D.

• Regular Meshes
• Scientific Computing
• Message-Passing Interface (MPI)
• Performance Tuning
• Hybrid MPI-pthreads model

Statement dc:rights

• Copyright 2010 Vivek Kale

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/18248

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/18248