BARNAT, Jiří, Petr BAUCH, Luboš BRIM a Milan ČEŠKA. Computing Optimal Cycle Mean in Parallel on CUDA. Online. Electronic Proceedings in Theoretical Computer Science. 2011, roč. 72, č. 2011, s. 68-83. ISSN 2075-2180. Dostupné z: https://dx.doi.org/10.4204/EPTCS.72.8. [citováno 2024-04-23] |
Další formáty:
BibTeX
LaTeX
RIS
@article{960289, author = {Barnat, Jiří and Bauch, Petr and Brim, Luboš and Češka, Milan}, article_number = {2011}, doi = {http://dx.doi.org/10.4204/EPTCS.72.8}, keywords = {Model checking; hardware platforms; parallelism}, language = {eng}, issn = {2075-2180}, journal = {Electronic Proceedings in Theoretical Computer Science}, note = {PDMC 2011}, title = {Computing Optimal Cycle Mean in Parallel on CUDA}, url = {http://eptcs.org/paper.cgi?PDMC2011.8}, volume = {72}, year = {2011} }
TY - JOUR ID - 960289 AU - Barnat, Jiří - Bauch, Petr - Brim, Luboš - Češka, Milan PY - 2011 TI - Computing Optimal Cycle Mean in Parallel on CUDA JF - Electronic Proceedings in Theoretical Computer Science VL - 72 IS - 2011 SP - 68-83 EP - 68-83 SN - 20752180 N1 - PDMC 2011 KW - Model checking KW - hardware platforms KW - parallelism UR - http://eptcs.org/paper.cgi?PDMC2011.8 N2 - 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 of optimal 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 be implemented 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. ER -
BARNAT, Jiří, Petr BAUCH, Luboš BRIM a Milan ČEŠKA. Computing Optimal Cycle Mean in Parallel on CUDA. Online. \textit{Electronic Proceedings in Theoretical Computer Science}. 2011, roč.~72, č.~2011, s.~68-83. ISSN~2075-2180. Dostupné z: https://dx.doi.org/10.4204/EPTCS.72.8. [citováno 2024-04-23]
|