COMPARISON OF VARIANTS OF MULTITHREADING REALIZATION OF METHOD OF BRANCHES AND BORDERS FOR MULTI-CORE SYSTEMS

Abstract

Recently, the main way to improve the performance of computing devices has become an increase in the number of processing cores in the processors, wherefore systems with shared memory have become widespread. Therefore, the development of parallel applications oriented to multi-core systems with shared memory becomes particularly topical. The article considers one of the classes of resource-intensive applications - the task of finding a global extremum of functions of several variables. One of the main approaches to solving such problems is the branch and boundary method. It is distinguished by the following features, essential from the point of view of parallelization: an unknown information graph in advance and the need to exchange information between computational threads. The article suggests several approaches to parallelizing the method of branches and boundaries. Currently, there are several standards for creating multi-threaded applications. The paper considers two such standards: OpenMP and C ++ 14. The OpenMP standard is characterized by higher development speed, but less flexible with respect to multithreaded extensions of C ++ 14, which allows you to vary the different modes of synchronization. We compare these approaches, as well as investigate the impact of various ways of organizing the computing process on application performance. The paper describes the algorithms and their software implementations. A technique for performing experimental studies on the performance of developed applications has been developed, which compares the proposed parallel algorithms on a representative set of test cases. It is shown that all the approaches considered lead to an acceleration of computations in comparison with the sequential variant. The best results are provided by the use of atomic variables for the interaction of threads. As computing platforms for conducting experiments, modern high-performance computing systems were used.

Authors and Affiliations

Andrei Gorchakov, Michael Posypkin

Keywords

Related Articles

ARTIFICIAL INTELLIGENT INTRUSION DETECTION SYSTEMS: PERSPECTIVES OF INNOVATIVE TECHNOLOGIES

The most popular development tools of the quantum cryptography technology are compared, the structure and the basic principles of its work is considered. In article the significance in the modern information society of t...

PROBLEM OF COMMON TRANSPORT SYSTEM ORGANIZATION

The paper discusses the problem of common transport system creation from system-wide positions. Much attention is focused on two aspects – active self-maintenance in the environment with disorganization and dual nature o...

SEMI-EMPIRICAL NEURAL NETWORK MODELS OF CONTROLLED DYNAMICAL SYSTEMS

A simulation approach is discussed for maneuverable aircraft motion as nonlinear controlled dynamical system under multiple and diverse uncertainties including knowledge imperfection concerning simulated plant and its en...

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...

SIGN LANGUAGE NOTATION SYSTEMS AND THEIR COMPARATIVE ANALYSIS

In this paper we describe gestures and sign language as means of non-verbal communication of people with hearing loss. We give a brief overview of existing sign language notations on currently, designed to depict gesture...

Download PDF file
  • EP ID EP508783
  • DOI 10.25559/SITITO.14.201801.138-148
  • Views 103
  • Downloads 0

How To Cite

Andrei Gorchakov, Michael Posypkin (2018). COMPARISON OF VARIANTS OF MULTITHREADING REALIZATION OF METHOD OF BRANCHES AND BORDERS FOR MULTI-CORE SYSTEMS. Современные информационные технологии и ИТ-образование, 14(1), 138-148. https://europub.co.uk/articles/-A-508783