This paper studies the validity of the BSP h-relation hypothesis on four current standard parallel platforms. The error introduced by the influence of the number of processors is measured on five communication patterns. We also measure the influence of the communication patterns on the time invested in an h-relation. The asynchronous nature of many current standard message passing programs do not easily fits inside the BSP model. Often this has been criticized as the most serious drawback of BSP. Based in the h-relation hypothesis we propose an extension to BSP model valid for standard message passing parallel programs. The use and accuracy of h-relation models on standard message passing programs are illustrated using a parallel algorithm to compute the Discrete Fast Fourier Transform.