Oleksandr Chemerys

Prof. Oleksandr Chemerys

orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2021
Verified
Book Chapter
Closed access
PDF file
VSVadym Shkarupylo
Vadym Shkarupylo
IBIhor Blinov
Ihor Blinov
OCOleksandr Chemerys
Oleksandr Chemerys
VDValentyna V. Dusheba
Valentyna V. Dusheba
JAJamil Alsayaydeh
Jamil Alsayaydeh

14 April 2017
Verified
Book Chapter
Closed access
PDF file
OCOleksandr Chemerys
Oleksandr Chemerys
DLDmitri Lazorenko
Dmitri Lazorenko
SSSergey Sushko
Sergey Sushko

1 April 2017
Verified
Conference Paper
Closed access
SSSergii Sushko
Sergii Sushko
OCOleksandr Chemerys
Oleksandr Chemerys
Energy efficiency and computational time become the key usability factors of the low power computational systems. In this sense optimization of the source code is a great challenge to make low power computational system competitive relative to other and adorable for the customers. The paper describes several experiments with a modern low power system that shows the influence of the program loop optimization on microprocessor system power consumption. Conclusions about positive effect of the automatic software optimization are presented.

22 September 2006
Verified
Conference Paper
Closed access
DLD.I. Lazorenko
D.I. Lazorenko
OCOleksandr Chemerys
Oleksandr Chemerys


19 November 2002
Verified
Conference Paper
Closed access
VBV. Beletsky
V. Beletsky
ABA. Bagaterenco
A. Bagaterenco
OCOleksandr Chemerys
Oleksandr Chemerys
Problems arising due to run existent software in parallel computer systems are considered. The problem may be formulated as the serial programs should be analyzed first and then through modification of them are to be brought in to make them able to run in parallel computers. The problems that arise have been analyzed and ways to tackle them are given. The structure of programming package is given. It is substantiated that for most sequential programs the major share of time spent for their execution is accounted for by processing loops. Three loop parallelization methods have been selected for implementation of programs: method of coordinates, method of linear transformations, and modified method of linear-piece parallelization. The dependence graph construction principles are expounded and scheduling methods are enumerated.