Application of parallel computing technology OpenMP to search for the generator polynomials

The paper deals with the application of parallel computing technology OpenMP to search for the generator polynomials. Forming the task of finding polynomials to create polynomial block codes is quite laborious. For example for generator polynomial, on which basis the fail-safe code (m = 32, t = 3), you need two weeks of continuous work program on the processor Intel XEON 5150 with a core clock of 2.66 GHz and RAM 1 GB. The article describes the search algorithm forming polynomials, which are constructed on the basis of codes more efficient than Bose-Chaudhuri-Hocquenghem codes. The article describes the ability to form the polynomials and analyzed in terms of the possibility of using parallel computing technology OpenMP. Computer experiment was delivered to compare the performance of software implementations with and without the OpenMP. Results supplied by the computer experiment to study the performance of sequential and parallelized implementations of the search algorithm polynomials showed that the usage of OpenMP technology allows under certain input parameters (m = 9, t = 2) to increase the speed of 20-24 times. On average, using of OpenMP algorithm enhances performance up to 3 times.