Research Article
Performance Comparison of OpenMP, MPI, and MapReduce in Practical Problems
Table 1
Execution times for the all-pairs-shortest-path problem.
| | Node size | Framework | | MapReduce | MPI | OpenMP | | Cluster | Single machine |
| | 10 | 2 m 26 s | 0.32 s | 0.34 s | 0.1 s | | 100 | 16 m 52 s | 0.44 s | 0.41 s | 0.25 s | | 1000 | 4 h 4 m 39 s | 4 m 48 s | 24.14 s | 8.03 s |
|
|