Utilization of parallel computing for discrete self-organizing migration algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86096069" target="_blank" >RIV/61989100:27240/16:86096069 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/16:86096069
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-28161-2_6" target="_blank" >http://dx.doi.org/10.1007/978-3-319-28161-2_6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-28161-2_6" target="_blank" >10.1007/978-3-319-28161-2_6</a>

Result language
angličtina
Original language name
Utilization of parallel computing for discrete self-organizing migration algorithm
Original language description
Evolutionary algorithms can take advantage of parallel computing, because it decreases the computational time and increases the size of processable instances. In this chapter, various options for a parallelization of DISCRETE SELFORGANISING MIGRATING ALGORITHM are described, with three implemented parallel variants described in greater detail. They covers the most frequently used hardware and software technologies, namely: parallel computing with threads and shared memory; general purpose programming on GPUs with CUDA; and distributed computing with MPI. The first two implementations speed up the computation, the last one moreover changes the original algorithm. It adds a new layer that simplifies its usage in the distributed environment.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

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

Similar results(10)