Systolic neighborhood search on graphics processing units

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Systolic neighborhood search on graphics processing units

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Systolic neighborhood search on graphics processing units

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název periodika

Soft computing

ISSN

1432-7643

e-ISSN

—

Svazek periodika

18

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

18

Strana od-do

125-142

Kód UT WoS článku

000329247000010

EID výsledku v databázi Scopus

—