Performance analysis issues for parallel implementations of propagation algorithm
Léonardo Brenner, Luiz Gustavo Fernandes, Paulo Fernandes, Afonso Sales · 2004
We present a theoretical study to evaluate the performance of a family of parallel implementations of the propagation algorithm. The propagation algorithm is used to an image interpolation application. The theoretical performance analysis is based on the construction of generic models using stochastic automata networks (SAN) formalism to describe each implementation scheme. The prediction results can be compared to the achieved performance in some real test cases to verify the accuracy of our modeling technique. The main contribution is to point out the advantages and problems of our approach to the development of generic models of parallel implementations.