EFFECTIVE REALIZATION OF EXACT ALGORITHMS FOR SOLVING DISCRETE OPTIMIZATION PROBLEMS ON GRAPHIC ACCELERATORS
Journal Title: Современные информационные технологии и ИТ-образование - Year 2018, Vol 14, Issue 2
Abstract
Most of the problems of discrete optimization belong to the class of NP-complete problems. This means that algorithms that can find their exact solution, in general, can work with exponential complexity relative to the length of the input data. Thanks to progress, today there are technologies that have not yet been widely used to implement applied optimization methods. Among these technologies is GP GPU (General Purposed Graphical Processing Unit). The application of this technology to well-known algorithms can help to achieve greater efficiency. The purpose of this paper is to investigate the possibilities of using parallel computations on video cards to solve discrete optimization problems. The problem of a one-dimensional Boolean knapsack was chosen as the target problem. To solve the problem, methods for obtaining an exact solution are considered - the full search algorithm, which is the starting point in the study, and the "branches and boundaries" method, which allows to reduce the search by eliminating obviously inappropriate solutions. The algorithms considered are estimated in terms of the number of operations and execution time, implemented in a single-threaded configuration of the central processor, and then parallelized on a video card. Based on the results of these methods, a combined algorithm was created that combines both algorithms to achieve greater efficiency. For parallelizing the calculations on the graphics card, the CUDA technology is chosen. Algorithms are implemented in C. After the implementation of the algorithms, testing was carried out on various data sets and different configurations of the target platform. The results of experimental studies are presented, the acceleration of work is investigated with the use of parallel computations and a comparative analysis of the efficiency of the algorithms is carried out.
Authors and Affiliations
Michael Popov, Mikhail Posypkin
Keywords
Related Articles
- EP ID EP519313
- DOI 10.25559/SITITO.14.201802.408-418
- Views 106
- Downloads 0
MULTIHEURISTIC APPROACH TO COMPARE THE QUALITY OF DEFINED METRICS ON THE SET OF DNA SEQUENCES
In this article, we analyzed some several metrics that determine the differences in DNA sequences of different species. Several standard metrics are considered, as well as a modification of the original author's metric,...
QUALITY ASSESSMENT OF ALLOCATION COORDINATES USEFUL RADIATION SOURCE IN CONTROL PROBLEMS
It is offered in control problems to carry out assessment quality of the coordinates of useful radiation source allocated by means of video sensors on set of indicators, in particular, using probability of detection of d...
STATEMENT OF THE PROBLEM OPTIMAL CONTROL THE HARDNESS OF THE STEEL PRODUCED BASED ON THE MODEL OF TAKAGI-SUGENO-KANG
This study discusses the problem of mathematical modeling of complex technological systems under uncertainty to obtain the most optimal parameters in the management of the production process in the applied field - metall...
TABULAR ARTIFICIAL NEURAL NETWORK IMPLEMENTATION OF RADIAL BASIS FUNCTIONS FOR THE SAMPLES CLASSIFICATION
The development and study of a new constructive algorithm for constructing models for sample classification using an artificial neural network with radial basis functions in a Microsoft Excel spreadsheet environment with...
ON THE UNIVERSAL TREE MODE OF HASH CODE GENERATION
Classical approaches to the construction of hash function modes, based on the using of iterative procedures, do not allow efficient processing of large amounts of data and can’t be adapted to parallel computing architect...