Adaptation of technology MPI and OpenMP to search for the generators polynomials
| Parent link: | The 9th International Forum on on Strategic Techology (IFOST-2014), September 21-23, 2014, Cox's Bazar, Bangladesh: [proceedings]. [P. 5-8].— , 2014 |
|---|---|
| Main Author: | |
| Corporate Author: | |
| Other Authors: | |
| Summary: | Title screen The paper describes the usage of technologies of parallel and distributed computing OpenMP and MPI to find generator polynomials which is quite a tedious task. The description of the generator polynomials search algorithm which are constructed on the basis of codes more efficient than codes Bose-Chaudhuri - Hocquenghem. The algorithm of generator polynomials search was considered and analyzed in terms of the possibility of using technologies of parallel and distributed computing. The computer program of the generator polynomials search with the technology of parallel and distributed computing OpenMP and MPI was described. As input parameters, the values of : m - length of the information block of messages and t - the multiplicity of correctable errors. Computer experiment was delivered to compare the performance of software implementations with and without the application of the above technologies. Results supplied by the computer experiment to study the performance of sequential and parallelized implementations of the generator polynomials search algorithm showed that the use of technology in conjunction with MPI and OpenMP greatly accelerates generator polynomials search. Thus, using 20 cores of Intel XEON 5150 processor for averaging the acceleration input parameters studied (m from 8 to 24, and t=4) was 2231 %. Режим доступа: по договору с организацией-держателем ресурса |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1109/IFOST.2014.6991059 |
| Format: | Electronic Book Chapter |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=641628 |