Algorithm for automatic loop parallelization for graphics processing units
Uloženo v:
| Název: | Algorithm for automatic loop parallelization for graphics processing units |
|---|---|
| Autoři: | Doroshenko, А.Yu., Yatsenko, O.A., Beketov, O.G. |
| Informace o vydavateli: | Інститут програмних систем НАН України |
| Rok vydání: | 2018 |
| Témata: | parallelization methods, loop optimization, general-purpose computing on graphics processing units, program design and synthesis, UDC 004.4'24 |
| Popis: | Parallelization of loop operators is a long standing problem of parallel programming. The widespread use of graphics processing units for computational tasks has resulted in the new statement of the mentioned problem for this class of multicore systems. The purpose of this work is to improve the mechanism of transformation of cyclic operators for loop parallelization for execution on a graphics processing unit. Software tool for computation optimization that allows to parallelize cyclic operators semi‑automatically was developed. Data bufferization synchronized with main loop execution was implemented, and the software tool using the rewriting rules system TermWare was built and integrated with the toolkit for design and synthesis of programs IDS. The developed system was tested using heterogeneous multicore cluster. The advantages of the developed system in comparison with well-known parallelization system Par4All consist in processing speed and the possibility of processing of data amounts exceeding the amount of memory of a graphics processing unit, and also the ability to use several graphics processing units simultaneously. The developed system was applied for parallelization of a serial loop, which is the part of a numerical weather forecasting program.Problems in programming 2017; 4: 028-036 |
| Druh dokumentu: | other/unknown material |
| Jazyk: | Ukrainian |
| Dostupnost: | https://harvester.nas.gov.ua/Record/pp_isofts_kiev_ua-article-308 |
| Přístupové číslo: | edsbas.278A8E3F |
| Databáze: | BASE |
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!