Floyd’sAlgorithm幻灯片.pptVIP

Parallel Programmingwith MPI and OpenMP;Chapter 6;Chapter Objectives;Outline;All-pairs Shortest Path Problem;Floyd’s Algorithm;Why It Works;Dynamic 1-D Array Creation;Dynamic 2-D Array Creation;Designing Parallel Algorithm;Two Data Decompositions;Comparing Decompositions;File Input;Pop Quiz;Point-to-point Communication;Send/Receive Not Collective;Function MPI_Send;Function MPI_Recv;Coding Send/Receive;Inside MPI_Send and MPI_Recv;Return from MPI_Send;Return from MPI_Recv;Deadlock;Computational Complexity;Communication Complexity;Execution Time Expression (1);Computation/communication Overlap;Execution Time Expression (2);Predicted vs. Actual Performance;Summary