| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava
Prva stran > Izpis gradiva

Izpis gradiva Pomoč

Naslov:Parallel self-avoiding walks for a low-autocorrelation binary sequences problem
Avtorji:ID Bošković, Borko (Avtor)
ID Herzog, Jana (Avtor)
ID Brest, Janez (Avtor)
Datoteke:.pdf 1-s2.0-S187775032400053X-main.pdf (1,82 MB)
MD5: 9A94AE46CBF071816EAFFFEC0D3D3F3D
 
Jezik:Angleški jezik
Vrsta gradiva:Neznano
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:FERI - Fakulteta za elektrotehniko, računalništvo in informatiko
Opis:A low-autocorrelation binary sequences problem with a high figure of merit factor represents a formidable computational challenge. An efficient parallel computing algorithm is required to reach the new best-known solutions for this problem. Therefore, we developed the sokol solver for the skew-symmetric search space. The developed solver takes the advantage of parallel computing on graphics processing units. The solver organized the search process as a sequence of parallel and contiguous self-avoiding walks and achieved a speedup factor of 387 compared with lssOrel, its predecessor. The sokol solver belongs to stochastic solvers and cannot guarantee the optimality of solutions. To mitigate this problem, we established the predictive model of stopping conditions according to the small instances for which the optimal skew-symmetric solutions are known. With its help and 99% probability, the sokol solver found all the known and seven new best-known skew-symmetric sequences for odd instances from to . For larger instances, the solver cannot reach 99% probability within our limitations, but it still found several new best-known binary sequences. We also analyzed the trend of the best merit factor values, and it shows that as sequence size increases, the value of the merit factor also increases, and this trend is flatter for larger instances.
Ključne besede:low-autocorrelation binary sequences, self-avoiding walk, graphic processor units, high performance computing
Poslano v recenzijo:01.03.2024
Datum sprejetja članka:04.03.2024
Datum objave:07.03.2024
Založnik:ScienceDirect
Leto izida:2024
Št. strani:9 str.
Številčenje:Vol. 77, [article no.] 102260
PID:20.500.12556/DKUM-90089 Novo okno
UDK:004.8
COBISS.SI-ID:188486403 Novo okno
DOI:10.1016/j.jocs.2024.102260 Novo okno
ISSN pri članku:1877-7511
Avtorske pravice:© 2024 The Author(s). Published by Elsevier B.V.
Datum objave v DKUM:22.08.2024
Število ogledov:45
Število prenosov:6
Metapodatki:XML DC-XML DC-RDF
Področja:Ostalo
:
BOŠKOVIĆ, Borko, HERZOG, Jana in BREST, Janez, 2024, Parallel self-avoiding walks for a low-autocorrelation binary sequences problem. Journal of computational science [na spletu]. 2024. Vol. 77, no. 102260. [Dostopano 14 marec 2025]. DOI 10.1016/j.jocs.2024.102260. Pridobljeno s: https://dk.um.si/IzpisGradiva.php?lang=slv&id=90089
Kopiraj citat
  
Skupna ocena:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
Objavi na:Bookmark and Share


Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:Journal of computational science
Založnik:Elsevier
ISSN:1877-7511
COBISS.SI-ID:175298563 Novo okno

Gradivo je financirano iz projekta

Financer:ARIS - Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Številka projekta:P2-0041
Naslov:Računalniški sistemi, metodologije in inteligentne storitve

Sekundarni jezik

Jezik:Slovenski jezik
Ključne besede:grafično procesiranje, algoritmi, stohastični procesi


Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
0 - 0 / 0
 
Ni komentarjev!

Nazaj
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici