Adaptation of technology MPI and OpenMP to searchfor the generators polynomials
| Parent link: | The 9th International Forum on Strategic Techology (IFOST-2014), September 21-23, 2014, Cox's Bazar, Bangladesh: [proceedings]. [4 p.].— , 2014 |
|---|---|
| Main Author: | |
| Corporate Author: | |
| Other Authors: | |
| Summary: | Title screen The paper describes the usage of technologies ofparallel and distributed computing OpenMP and MPI to findgenerator polynomials which is quite a tedious task. Thedescription of the generator polynomials search algorithm whichare constructed on the basis of codes more efficient than codesBose-Chaudhuri - Hocquenghem. The algorithm of generatorpolynomials search was considered and analyzed in terms of thepossibility of using technologies of parallel and distributedcomputing. The computer program of the generator polynomialssearch with the technology of parallel and distributed computingOpenMP and MPI was described. As input parameters, thevalues of : m - length of the information block of messages and t -the multiplicity of correctable errors. Computer experiment wasdelivered to compare the performance of softwareimplementations with and without the application of the abovetechnologies. Results supplied by the computer experiment tostudy the performance of sequential and parallelizedimplementations of the generator polynomials search algorithmshowed that the use of technology in conjunction with MPI andOpenMP greatly accelerates generator polynomials search. Thus,using 20 cores of Intel XEON 5150 processor for averaging theacceleration input parameters studied (m from 8 to 24, and t = 4)was 2231 %. |
| Published: |
2014
|
| Series: | Information & Communication Technology Algorithms, Data Base and Data structure |
| Subjects: | |
| Online Access: | http://180.211.172.109/ifost2014Pro/pdf/S1-P71.pdf |
| Format: | Electronic Book Chapter |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=641676 |