The trace parsing algorithm of complex analysis tools of balancing algorithms performance in a parallel branch and bound method

Y.V. Orlov

Abstract


The present paper describes the trace parsing algorithm of the environment for a comprehensive performance analysis of load balancing algorithms in parallel branch and bound methods. The main objective of the proposed algorithm is to accelerate the process of parsing trace and preparing data for visualization. Considered in detail the causes of slowdowns during the process of parsing trace, offered a new solution and produced experimental confirmation.


Full Text:

PDF (Russian)

References


Lebedev I., Gergel V. Heterogeneous Parallel Computations for Solving Global Optimization Problems //Procedia Computer Science. – 2015. – T. 66. – S. 53-62.

Evtushenko Y., Posypkin M., Sigal I. A framework for parallel large-scale global optimization //Computer Science-Research and Development. 2009. T. 23. #. 3-4. S. 211-215.

Golubeva Y., Orlov Y., Posypkin M. A tool for simulating parallel branch-and-bound methods //Open Engineering. 2016. T. 6. #. 1. S.219-224

Ju. V. Orlov, Sreda kompleksnogo analiza proizvoditel'nosti algoritmov balansirovki v parallel'nom metode vetvej i granic// International Journal of Open Information Technologies ISSN: 2307-8162. vol. 3, no. 9, 2015. URL: http://injoit.org/index.php/j1/article/view/228 (data obrashhenija 20.05.2015)

A.L. Fomin. Programmnaja model' parallel'noj realizacii metoda vetvej i granic //International Journal of Open Information Technologies. – 2015 – T.3. - # 11.

Tomas H. Kormen, Charl'z I. Lejzerson, Ronal'd L. Rivest, Klifford Shtajn. Algoritmy: postroenie i analiz, 3-e izdanie M.: «Vil'jams». 2013. S. 90-139.


Refbacks

  • There are currently no refbacks.


Abava  Absolutech Convergent 2020

ISSN: 2307-8162