Predicting the performance of injection communication patterns on PVM

Roda, José L.; Rodríguez, Casiano; Almeida, Francisco; González-Morales, Daniel

doi:10.1007/3-540-63697-8_67

Cited by 3 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The accuracy of the models for a 524.288 complex instance is shown in Figures 9 and 10. The Error percentage displayed in Figure 11 has been computed using the formula Error = 100 * (Actual Time − Model Time)/Actual Time (18) Model and real time curves corresponding to the IBM SP2 appear overlapped. The error grows with the number of processors.…”

Section: The Fast Fourier Algorithm Examplementioning

confidence: 99%

Predicting the execution time of message passing models

Roda

Rodríguez

Morales

et al. 1999

Concurrency: Pract. Exper.

Self Cite

View full text Add to dashboard Cite

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. Copyright © 1999 John Wiley & Sons, Ltd.

show abstract

Section: The Fast Fourier Algorithm Examplementioning

confidence: 99%