Comparative Analysis of Parallel Algorithm’s Optimization Methods Taking into Consideration or Ignoring the Execution Time of Operations
DOI:
https://doi.org/10.32603/2071-2340-3-38-48Keywords:
optimization, algorithm, information graph, sequence list, execution time, operation, process, processor, information dependence, unit of timeAbstract
In this paper, we propose an analysis of our (developed by us) methods for optimizing the parallel algorithm, taking into account and without taking into account the execution time of each operation. These methods can be applied on sequential algorithms in order to obtain their parallel analogue as well as on parallel algorithms in order to improve their quality. The proposed methods for optimizing the parallel algorithm can reduce the amount of communication between processors and, accordingly, reduce the execution time of the entire algorithm.
Downloads
Published
2018-06-29
Issue
Section
Software Engineering
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
[1]
M. H. A. Al-Mardi, “Comparative Analysis of Parallel Algorithm’s Optimization Methods Taking into Consideration or Ignoring the Execution Time of Operations”, Computer Tools in Education, no. 3, pp. 38–48, Jun. 2018, doi: 10.32603/2071-2340-3-38-48.
