Performance and Predictability of MPI and BSP Programs on the CRAY T3E
It has been argued that message passing systems based on pairwise, rather than barrier, synchronization suffer from having no simple analytic cost for model prediction. The BSP Without Barriers Model (BSPWB) has been proposed as an alternative to the Bulk Synchronous Parallel (BSP) model for the analysis, design and prediction of asynchronous MPI programs. This work compares the prediction accuracy of the BSP and BSPWB models and the performance of their respective software libraries: Oxford BSPlib and MPI. Three test cases, representing three general problem solving paradigms are considered. These cases cover a wide range of requirements in communication, synchronisation and computation. The results obtained on the CRAY-T3E show not only a better scalability of MPI but that the performance of MPI programs can be predicted with the same exactitude than Oxford BSPlib programs.
KeywordsSpan Tree Minimum Span Tree Knapsack Problem Bulk Synchronous Parallel Barrier Synchronization
Unable to display preview. Download preview PDF.
- 1.Roda J., Rodríguez C., Morales D.G., Almeida F., Pulido P., Dorta D. Breaking the Barriers: Two Models for MPI Programming. Proc. of Int. Conference on Parallel Architectures and Compilation Techniques. pp. 248–255, 1998.Google Scholar
- 2.Skillcorn, D.B., Hill, J., McColl, W.F. Questions and Answers about BSP. Oxford University Computing Laboratory. Report PRG-TR-15-96. 1996.Google Scholar