International Conference on Parallel Computing in Electrical Engineering (PARELEC'02) (2002)
Sept. 22, 2002 to Sept. 25, 2002
Anatoly Prihozhy , EPFL and ABAPRB
Daniel Mlynek , EPFL
Michail Solomennik , ABAPRB
Marco Mattavelli , ABAPRB
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are presented. The parallelization level of the algorithms is defined by a set of parallel operator pairs. The optimization techniques cover the two key steps of parallelization flow: the generation of an optimal initial set of parallel operator pairs to meet the constraints on the execution time or implementation cost, and the generation of the final set of pairs to solve the net algorithm existence problem. The quality of the proposed techniques is evaluated by experimental results. The techniques based on the minimization of the net algorithm critical paths estimated using the maximal weight cliques of the sequential and parallel operator graphs constitute the most efficient approach to the generation of the initial and final sets of parallel operator pairs.
net algorithm, existence problem, critical path, parallelization, optimization
D. Mlynek, A. Prihozhy, M. Mattavelli and M. Solomennik, "Techniques for Optimization of Net Algorithms," International Conference on Parallel Computing in Electrical Engineering (PARELEC'02)(PARELEC), Warsaw, Poland, 2002, pp. 211.