Performance Analysis of Variants of the Branch and Bound Method for Graphics Accelerators

Student: Kochergin Vladislav

Supervisor: Mikhail Posypkin

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Final Grade: 9

Year of Graduation: 2020

The branch and bound (B\&B) method is a way to solve NP-hard problems relatively quickly. Graphics accelerators are used to expedite the process by executing the algorithm in a number of parallel threads. But the parallelization of the B\&B method is non-trivial due to the peculiarities of the architecture of the graphics accelerators. There are several approaches to implement the parallelization of the B\&B method. In this research, the performance of the approaches will be evaluated using the high-performance computer cluster. Keywords: Graphics Accelerators, Branch and Bound, Optimization, High Performance Computing, CUDA, GPU.

Full text (added May 20, 2020)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses