Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
Application of parallel algorithm optimisation method to relational queries by reducing interprocessor data exchange time. / Shichkina, Yulia; Haidar Awadh, Al-Mardi Mohammed ; Storublevtcev, Nikita; Degtyarev, Alexander.
в: International Journal of Web and Grid Services, Том 15, № 2, 06.05.2019, стр. 191-205.Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
}
TY - JOUR
T1 - Application of parallel algorithm optimisation method to relational queries by reducing interprocessor data exchange time
AU - Shichkina, Yulia
AU - Haidar Awadh, Al-Mardi Mohammed
AU - Storublevtcev, Nikita
AU - Degtyarev, Alexander
PY - 2019/5/6
Y1 - 2019/5/6
N2 - 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.
AB - 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.
KW - Algorithm execution schedule
KW - Algorithm optimisation
KW - Information graph
KW - Interprocessor data transfer
KW - Operation execution time
KW - Parallel algorithm
KW - Process
KW - Processor
KW - Relational database
UR - http://www.scopus.com/inward/record.url?scp=85065704596&partnerID=8YFLogxK
U2 - 10.1504/IJWGS.2019.099563
DO - 10.1504/IJWGS.2019.099563
M3 - Article
AN - SCOPUS:85065704596
VL - 15
SP - 191
EP - 205
JO - International Journal of Web and Grid Services
JF - International Journal of Web and Grid Services
SN - 1741-1106
IS - 2
ER -
ID: 42211474