Systolic neighborhood search on graphics processing units

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86093022" target="_blank" >RIV/61989100:27240/14:86093022 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00500-013-1041-7" target="_blank" >http://dx.doi.org/10.1007/s00500-013-1041-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00500-013-1041-7" target="_blank" >10.1007/s00500-013-1041-7</a>

Result language
angličtina
Original language name
Systolic neighborhood search on graphics processing units
Original language description
In this paper, we propose a parallel processing model based on systolic computing merged with concepts of evolutionary algorithms. The proposed model works over a Graphics Processing Unit using the structure of threads as cells that form a systolic mesh.Data passes through those cells, each one performing a simple computing operation. The systolic algorithm is implemented using NVIDIA's compute unified device architecture. To investigate the behavior and performance of the proposed model we test it over a NP-complete problem. The study of systolic algorithms on GPU and the different versions of the proposal show that our canonical model is a competitive solver with efficacy and presents a good scalability behavior across different instance sizes. 2013Springer-Verlag Berlin Heidelberg.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)