Hi, every one, I am working with open-mpi. When I tried to analyse performance of my programs, I find it is hard to understand the communication complexity of MPI routines.
I have found some page on Internet such as http://stackoverflow.com/questions/10625643/mpi-communication-complexity This indicates that communication complexity of broadcasting an integer is O(log P) where P is the number of processes. But is it correct on different MPI implementations( OMPI, MPICH, etc.)? Is there an official document discussing such complexity? -- Best Regards. --- Xing FENG PhD Candidate Database Research Group School of Computer Science and Engineering University of New South Wales NSW 2052, Sydney Phone: (+61) 413 857 288
