METHOD OPTIMIZATION OF THE PARALLEL ALGORITHM BY REDUCING THE AMOUNT OF INTERPROCESSOR COMMUNICATION OF INFORMATION
In this paper, we propose a method for constructing an efficient algorithm by the number of used processors, the execution time of the algorithm and the volume of interprocessor transfers. This method can be applied for sequential algorithms to get their parallel analogue and for parallel algorithm in order to improve their quality. The method of optimization of information graph by reducing interprocessor communication links can reduce the amount of communication between processors and therefore reduce the total execution time of the algorithm. Application of the optimization algorithm can achieve higher levels of performance, efficiency and high-speed processing of parallel programs.
Authors: M. H. A. Al-Mardi, Yu. Shichkina
Direction: Informatics and Computer Technologies
Keywords: Algorithm, parallel execution, sequence list, execution time, operation, process, processor, information dependence, equivalent conversions, information graph
View full article