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

Yulia Shichkina, Al-Mardi Mohammed Haidar Awadh, Nikita Storublevtcev, Alexander Degtyarev

Результат исследований: Научные публикации в периодических изданияхстатья

Аннотация

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.

Язык оригиналаанглийский
Страницы (с-по)191-205
Число страниц15
ЖурналInternational Journal of Web and Grid Services
Том15
Номер выпуска2
DOI
СостояниеОпубликовано - 6 мая 2019

    Fingerprint

Предметные области Scopus

  • Программный продукт
  • Компьютерные сети и коммуникации

Цитировать