Title: Application of parallel algorithm optimisation method to relational queries by reducing interprocessor data exchange time

Authors: Yulia Shichkina; Al-Mardi Mohammed Haidar Awadh; Nikita Storublevtcev; Alexander Degtyarev

Addresses: Department of Computer Science and Engineering, Saint Petersburg Electrotechnical University 'LETI', St. Petersburg, Russia ' Department of Computer Science and Engineering, Saint Petersburg Electrotechnical University 'LETI', St. Petersburg, Russia ' Saint Petersburg State University, St. Petersburg, Russia ' Saint Petersburg State University, St. Petersburg, Russia

Abstract: The article presents the results of studies on the adaptation of methods for optimising parallel algorithms by time and volume of computational resources to queries in relational databases. Research focuses on a method that allows you to improve the execution schedule of a parallel query by execution time due to the redistribution of operations between processes. It leads to a reduction in amount of messages transferred between processors, and to the time spent on transfer of data. It does not affect the amount of computational resources. The method is based on adjacency lists that correspond to the information graph of the algorithm. It can be applied in conjunction with other scheduling methods, for example, focused on computation node count optimisation, to achieve optimal result within multiple parameters.

Keywords: parallel algorithm; algorithm optimisation; information graph; operation execution time; algorithm execution schedule; process; processor; interprocessor data transfer; relational database.

DOI: 10.1504/IJWGS.2019.099563

International Journal of Web and Grid Services, 2019 Vol.15 No.2, pp.191 - 205

Received: 26 Oct 2018
Accepted: 01 Feb 2019

Published online: 06 May 2019 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article