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 95
- Downloads 0
METHODICAL DEVELOPMENT FOR THE STUDY OF ARRAY PROCESSING ALGORITHMS USING MODERN PROGRAMMING LANGUAGE TOOLS
The author's task was to develop methodological support for studying algorithms for processing arrays by modern means of the programming language in the Informatics lesson. The author set goals and objectives of the less...
ON THE TASKS OF THE DIGITAL ECONOMY, LOOKING BACK AT THE WORKS OF PROFESSOR KARL BALLOD
The works of Karl Ballod (1864-1931) - a Russian-German economist of world importance (of Latvian origin) are analyzed. K. Ballod received scientific recognition early: already in 1898 - at the age of 34 - he received th...
ON REGULARIZATION OF INVERSE PROBLEM FOR HEAT EQUATION
The paper contains new results on spectral methods for solving ill-posed problems using the example of the Cauchy problem for a parabolic equation. A method for regularizing the solution of the inverse problem is propose...
TO THE QUESTION ABOUT THE DEVELOPMENT OF INFORMATION-TECHNOLOGICAL COMPETENCE OF ADULT POPULATION OF RUSSIA
The rapid development of information technology has had a tremendous impact on all spheres of life of human society. The development of IT culture, information and technological competence has become a prerequisite for t...
USE OF MODERN TECHNOLOGIES IN TEACHING PHYSICS DURING EDUCATION OF BUCHELORS
In article teaching the subject "Physics" at Institute of information technologies, mathematics and mechanics (IITMM) of N.I. Lobachevsky State University of Nizhni Novgorod is discussed. Adaptation of a course to the ne...