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 109
- Downloads 0
THEORETICALLY UNBREAKABLE CIPHERS AS THEY SHOULD BE UNDERSTOOD
Perfectly-secret ciphers according to the Claude Shannon's theory, which are considered as unbreakable, and more specifically random keystream ciphers, are discussed. An analysis of the sources mentioned in the reference...
STRUCTURAL AND METHODICAL MODEL OF INCREASING THE LEVEL OF THEORETICAL TRAINING OF CADETS USING INFORMATION AND COMMUNICATION TECHNOLOGIES
Features of training in higher educational institutions of system of EMERCOM of Russia demand introduction of the new educational techniques and the technical means directed on intensification of educational process, pro...
EFFICIENCY OF MODERN OPERATING SYSTEMS
The variety of the modern multi-vendor universal and specialized operating systems (OS), designed for application in certain subject areas, poses a number of questions: which system should one choose for an automated inf...
EXPERIMENTAL SOFTWARE FOR MODELING AND INTERPRETING EDUCATIONAL DATA ANALYSIS PROCESSES
Problems, tasks and processes of educational data mining are considered in this article. The objective is to create a fundamentally new information system of the University using the results educational data analysis. On...
INFORMATION TECHNOLOGY FORECAST THE EMERGENCY OF AIR POLLUTION EXHAUST GASES OF SHIPS AND VEHICLE
Information technology of monitoring of air environment quality based on the solution of a differential equation of atmospheric diffusion, measurements of concentrations of pollutants, the intensity and structure of tran...