Mpi Test Suite Multi ThreadedPresentation Transcript
Presenter : Nageeb Yahya Alsurmi GS21565 Lecturer : Assoc. Prof. Dr Mohamed Othman Test Suite for Evaluating Performance of MPI Implementations That Support MPI_THREAD_MULTIPLE By: Rajeev Thakur and William Gropp Argonne National Laboratory, USA
The two main requirements for a thread-compliant implementation:
1- All MPI calls are thread-safe.
2- Blocking MPI calls will block the calling thread only, allowing another thread to execute, if available.
The MPI benchmarks from Ohio State University only contain a multithreaded latency test.
The latency test is a ping-pong test with one thread on the sender side and two (or more) threads on the receiver side.
There are a number of MPI benchmarks exist, such as SKaMPI and Intel MPI Benchmarks , but they do not measure the performance of multithreaded MPI programs.
With thread-safe MPI implementations becoming increasingly common, users are able to write multithreaded MPI programs that make MPI calls concurrently from multiple threads.
Developing a thread-safe MPI implementation
is a fairly complex task.
Users, therefore, need a way to measure the outcome and determine how efficiently an implementation can support multiple threads.
The authors proposed a test suite that can shed light on the performance of an MPI implementation in the multithreaded case.
To understand the test suite you have first to understand the thread-safety specification in MPI.
MPI defines four “levels” of thread safety:
1-MPI_THREAD_SINGLE Each process has a single thread of execution .
2. MPI_THREAD_FUNNELED A process may be multithreaded, but only the Main thread that initialized MPI may make MPI calls.
T P1 T T m T P1 T T m T P2 P2 T MPI Call MPI Call MPI Call MPI Call
3. MPI THREAD SERIALIZED A process may be multithreaded, but only one thread at a time may make MPI calls.
4. MPI THREAD MULTIPLE A process may be multithreaded, and multiple threads may simultaneously call MPI functions (with some restrictions mentioned below).
T T P1 T T P1 T 1 2 3 MPI Call MPI Call MPI Call T MPI Call MPI Call MPI Call
if your code does not access the same memory location from multiple threads without protection, it is most likely thread-safe.
This is fairly minimal thread safety since you must ensure that your programs logic is thread safe, that is if your application is multithreaded .
In this context thread safety means that execution of multiple threads does not in itself corrupt the state of your objects .
Deadlock occurs when a process holds a lock and then attempts to acquire a second lock. If the second lock is already held by another process, the first process will be blocked. If the second process then attempts to acquire the lock held by the first process, the system has "deadlocked": no progress will ever be made
They cause blocking, which means some threads/processes have to wait until a lock (or a whole set of locks) is released
Process 0 Process 1 Thread 0 Thread 1 Thread 1 Thread 0 MPI_Recv(src1) MPI_Send(dest1) MPI_Recv(src0) MPI_Send(dest0) Buffer full Wait for thread 1 to complete the send operation to start reading from the buffer The buffer is full but still a data are sending so thread 1 wait for thread 0 to empty (read) the buffer
There are many MPI implementations but in this paper , just used four implementations:
MPICH2 it’s a library and portable
It’s a library ( not compiler ), It can achieve parallelism using networked machines or using multitasking on a single machine.
portable implementation of MPI , a standard for message-passing .
can be used for communication between processors.
merger between three well-known MPI implementations (FT-MPI, LA-MPI, LAM/MPI ).
(MPI) SUN MPI run on SUN machines
It is Sun Microsystems' implementation of MPI
IBM’s MPI runs on IBM SP systems and AIX workstation clusters.
The test suit has carried on multiple MPI implementation with different platforms.
Linux Cluster (AMD Opetron two DualCore)
MPICH2 V 1.05
SUN Fire SMP E2900 UtraSparc has 8 DualCore (SUN cluster)
how much thread locks affect the cumulative bandwidth.
Linux Cluster (AMD Opetron two dual-core)
MPICH2 no measurable difference in bandwidth between threads and processes.
OpenMPI there is a decline in bandwidth with threads.
IBM MPI & SUN MPI there is a substantial decline
(more than 50% in some cases) in the bandwidth when threads were used.
This is similar to the concurrent bandwidth test except that it measures the time for individual short messages.
P1 P2 P3 P4 P4 P2 P3 P2 P1 P2 P3 P4 P1 P1 P1 T1 T2 T1 T2 T1 T2 T1 T1 T2 T2 T1 T1 T2 T2 T1 T1 T2 Short message series Short message series Process Mutti threading
overhead in latency when using concurrent threads instead of processes
MPICH2 overhead is about 20 μ s.
Open MPI overhead is about 30 μ s.
IBM MPI & SUN MPI
the latency with threads is about 10 times the latency with processes.
But still the IBM & SUN has the low latency compared with MPICH & Open MPI.
This test is a blend of the concurrent bandwidth and concurrent latency tests
This test tests the fairness of thread scheduling and locking
P1 P2 P0 P1 P2 P3 P1 P1 P0 T1 T2 T1 T2 T1 T2 T1 T2 T2 T1 T1 T2 Short message series Short message series Long message P2 Long message Process Multi Threads
This result demonstrates that, in the threaded.
case, locks are fairly held and released and that the thread blocked in the long message send does not block the other thread.
Test1 (non threading mode )- has an iterative loop in which a process communicates with its four nearest neighbors by posting nonblocking sends and receives, followed by a computation phase, followed by an MPI_ Waitall for the communication to complete.
T est2 ( threading mode ). - is similar except that, before the iterative loop, each process spawns a thread that blocks on an MPI_Recv.
This technique effectively simulates asynchronous progress by the MPI implementation.
If total time ( threading mode ) < total time ( non threading ) there is no overlap.
compares the performance of concurrent calls to a collective function (MPI Allreduce) issued from multiple threads to that when issued from multiple processes.
T1 T2 T1 T2 P1 P1 P1 T1 T2 Multi Threads
3-2 Concurrent Collectives test 2/3
P1 P1 P1 Process
results on the Linux cluster. MPICH2 has relatively small overhead for the threaded version, compared with Open MPI.
evaluates the ability to use a thread to hide the latency of a collective operation.
The same test as last test but each node has p cores, specify a p+1 as the number of threads.
Thread p does an MPI_Allreduce with its corresponding threads on other nodes.
Then compared with the case with no allreduce thread (the higher the better).
the results on the Linux cluster. MPICH2 demonstrates a better ability than Open MPI to hide the latency of the allreduce.
MPI implementations supporting MPI THREAD MULTIPLE become increasingly available.
The Authors have developed such a test
suite and show its performance on multiple platforms and implementations
The results indicate
Good performance with MPICH2 and Open MPI
on Linux clusters.
Poor performance with IBM and Sun MPI on IBM and
Sun SMP systems
The Authors plan to add more tests to the suite, such as to measure the overlap of computation/communication with the MPI-2 file I/O and connect-accept features.
1. Francisco Garc´ıa, Alejandro Calder´on, and Jes´us Carretero. MiMPI: A multithreadsafe
implementation of MPI. In Recent Advances in Parallel Virtual Machine and
Message Passing Interface, 6th European PVM/MPI Users’ Group Meeting , pages
207–214. Lecture Notes in Computer Science 1697, Springer, September 1999.
2. William Gropp and Rajeev Thakur. Issues in developing a thread-safe MPI implementation.
In Recent Advances in Parallel Virtual Machine and Message Passing
Interface, 13th European PVM/MPI Users’ Group Meeting , pages 12–21. Lecture
Notes in Computer Science 4192, Springer, September 2006.
3. Intel MPI benchmarks. http://www.intel.com.
4. OSU MPI benchmarks. http://mvapich.cse.ohio-state.edu/benchmarks.
5. Boris V. Protopopov and Anthony Skjellum. A multithreaded message passing
interface (MPI) architecture: Performance and program issues. Journal of Parallel
and Distributed Computing , 61(4):449–466, April 2001.
6. Ralf Reussner, Peter Sanders, and Jesper Larsson Tr¨aff. SKaMPI: A comprehensive
benchmark for public benchmarking of MPI. Scientific Programming , 10(1):55–65,
Any Questions @ MPI Multiple threading Ada Soalan !!!!