Computing Optimal Cycle Mean in Parallel on CUDA

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00050202" target="_blank" >RIV/00216224:14330/11:00050202 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4204/EPTCS.72.8" target="_blank" >http://dx.doi.org/10.4204/EPTCS.72.8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4204/EPTCS.72.8" target="_blank" >10.4204/EPTCS.72.8</a>

Result language
angličtina
Original language name
Computing Optimal Cycle Mean in Parallel on CUDA
Original language description
Computation of optimal cycle mean in a directed weighted graph has many applications in program analysis, performance verification in particular. In this paper we propose a data-parallel algorithmic solution to the problem and show how the computation ofoptimal cycle mean can be efficiently accelerated by means of CUDA technology. We show how the problem of computation of optimal cycle mean is decomposed into a sequence of data-parallel graph computation primitives and show how these primitives can beimplemented and optimized for CUDA computation. Finally, we report a fivefold experimental speed up on graphs representing models of distributed systems when compared to best sequential algorithms.
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
—

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>Z - Vyzkumny zamer (s odkazem do CEZ)

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

Similar results(10)