Augustynowicz, Pawel and Kanciak, Krzysztof (2019) The search of square m-sequences with maximum period via GPU and CPU. INFOCOMMUNICATIONS JOURNAL, 11 (4). pp. 17-22. ISSN 2061-2079
|
Text
InfocomJ_2019_4_3_Augustynowicz.pdf Download (868kB) | Preview |
Abstract
This paper deals with the efficient parallel search of square m-sequences on both modern CPUs and GPUs. The key idea is based on applying particular vector processor instructions with a view to maximizing the advantage of Single Instruction Multiple Data (SIMD) and Single Instruction Multiple Threads (SIMT) execution patterns. The developed implementation was adjusted to testing for the maximum-period of m-sequences of some particular forms. Furthermore, the early abort sieving strategy based on the application of SAT-solvers were presented. With this solution, it is possible to search m-sequences up to degree 32 exhaustively.
| Item Type: | Article |
|---|---|
| Subjects: | H Social Sciences / társadalomtudományok > HE Transportation and Communications > HE2 Communications / hírközlés Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | Andrea Tankó |
| Date Deposited: | 28 Sep 2021 12:41 |
| Last Modified: | 28 Sep 2021 12:41 |
| URI: | http://real.mtak.hu/id/eprint/131189 |
Actions (login required)
 |
Edit Item |
