loading...
Exploring the Predictability of MPI Messages
Nice, France April 22-April 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213167International Parallel and Distribute ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Felix Freitag, Technical University of Catalonia
Jordi Caubet, Technical University of Catalonia
Montse Farrera, Technical University of Catalonia
Toni Cortes, Technical University of Catalonia
Jesus Labarta, Technical University of Catalonia
Scalability to a large number of processes is one of the weaknesses of current MPI implementations. Standard implementations scale to hundreds of nodes, but no beyond that. Performance is often more important than scalability and thus some assumptions about resources are taken that will not scale well. In this paper, we show that characteristics such as the size and the sender of MPI messages are very predictable (accuracy above 90%). Then, we present some examples where current MPI implementations on a large configuration would not work well and how this predictability could be used to solve the scalability problem.
Citation:
Felix Freitag, Jordi Caubet, Montse Farrera, Toni Cortes, Jesus Labarta, "Exploring the Predictability of MPI Messages," ipdps, pp.69b, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions