Asymptotical behaviour of the speed-up of one parallel algorithm

Rok, strany: 2005, 93 - 100

An earlier suggested parallel ``ring'' algorithm for solving the spatially one-dimensional initial-boundary-value problem (IBVP) for a parabolic equation using an explicit difference method is shortly described. Asymptotical behaviour of the speed-up function of this parallel algorithm is studied. The speed-up function is determined as the ratio between necessary times for realization of the algorithm in sequentional and parallel cases. Theoretical estimates of the speed-up function show the significant speed-up of the parallel algorithm in comparison with the serial one for large values of the parameter $q$, where $q$ is the maximum of values computed by one processor during one time level. It is shown that the coefficient of the speed-up tends to number of using processors, if the parameter $q$ tends to infinity.

ISO 690:

Purcz, P. 2005. Asymptotical behaviour of the speed-up of one parallel algorithm. In Tatra Mountains Mathematical Publications, vol. 30, no.1, pp. 93-100. 1210-3195.

APA:

Purcz, P. (2005). Asymptotical behaviour of the speed-up of one parallel algorithm. Tatra Mountains Mathematical Publications, 30(1), 93-100. 1210-3195.