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

Research output

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.

Original languageEnglish
Pages (from-to)191-205
Number of pages15
JournalInternational Journal of Web and Grid Services
Volume15
Issue number2
DOIs
Publication statusPublished - 6 May 2019

Fingerprint

Electronic data interchange
Parallel algorithms
Scheduling

Scopus subject areas

  • Software
  • Computer Networks and Communications

Cite this

@article{a0d5646f3f92447892b3972a6897c260,
title = "Application of parallel algorithm optimisation method to relational queries by reducing interprocessor data exchange time",
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 = "Algorithm execution schedule, Algorithm optimisation, Information graph, Interprocessor data transfer, Operation execution time, Parallel algorithm, Process, Processor, Relational database",
author = "Yulia Shichkina and {Haidar Awadh}, {Al-Mardi Mohammed} and Nikita Storublevtcev and Alexander Degtyarev",
year = "2019",
month = "5",
day = "6",
doi = "10.1504/IJWGS.2019.099563",
language = "English",
volume = "15",
pages = "191--205",
journal = "International Journal of Web and Grid Services",
issn = "1741-1106",
publisher = "Inderscience Enterprises Ltd.",
number = "2",

}

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.

In: International Journal of Web and Grid Services, Vol. 15, No. 2, 06.05.2019, p. 191-205.

Research output

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 -