𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Predicting the execution time of message passing models

✍ Scribed by Roda, J. L.; Rodríguez, C.; Morales, D. G.; Almeida, F.

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
212 KB
Volume
11
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

✦ Synopsis

Recent publications prove that runtime systems oriented to the Bulk Synchronous Parallel Model usually achieve remarkable accuracy in their predictions. That accuracy can be seen in the capacity of the software for packing the messages generated during the superstep and their capability to find a rearrangement of the messages sent at the end of the superstep. Unfortunately, barrier synchronisation imposes some limits both in the range of available algorithms and in their performance. The asynchronous nature of many MPI/PVM programs makes their expression difficult or infeasible using a BSP oriented library. Through the generalisation of the concept of superstep we propose two extensions of the BSP model: the BSP Without Barriers (BSPWB) and the Message Passing Machine (MPM) models. These new models are oriented to MPI/PVM parallel programming. The parameters of the models and their quality are evaluated on four standard parallel platforms. The use of these BSP extensions is illustrated using the Fast Fourier Transform and the Parallel Sorting by Regular Sampling algorithms.

📜 SIMILAR VOLUMES

cover
The Sweet Passing of Time
✍ Jason Cosnett 📂 Fiction 🌐 English ⚖ 14 KB 👁 3 views

‘I could tell she was full of mixed emotions,’ he continued. ‘For a twelve-year-old, she was very mature. She understood things that only an adult might comprehend. So I told her that it would be all right, that we’d still be able to come down and play and throw pebbles every day even if the Germans