The optimization method of a macro dataflow graph for reconfigurable computing systems
Main Article Content
Abstract
The method of optimizing the structure of the task graph represented by a macro dataflow graph, is proposed. The method takes into account the requirement to minimize execution time and the limitations of hardware resources. The method improves the performance of reconfigurable computing systems. References 7, figures 3, table 1
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
References
Dronov V.V. (2001), “Problems simulation in real time”. Vestnik NovSU. Seriya: Yestestvennye i tehnicheskie nauki. Vol. 19, pp. 99 – 102. (Rus)
Dronov V.V., Ivanov Y.V. (2001), “Parallelization of computational algorithm by lowering the priority”. Vestnik NovSU. Seriya: Yestestvennye i tehnicheskie nauki. Vol. 22, pp. 46 – 49. (Rus)
Klymenko I.A. (2014), “The method of mapping tasks to the reconfigurable architecture of the computer system”. Visnyk NTUU “KPI” Informatyka, upravlinnya ta obchyslyuvalna tehnika. Vol. 59, P.159. (Ukr)
Lyevin I.I., Ponomaryov I.M., Shmatok A.V. (2001), “Methods for the conversion of parallel programs the computer system configuration”. Shtutchnuy intelekt. Vol. 3, pp. 212 – 227 (Rus)
Pospyelov D.A. (1972), “Introduction to Computer Systems”. М.: Sovetskoye radio, P. 280. (Rus)
Bansal S., Kumar P., Singh K. (2006), “An improved two-step algorithm for task and data parallel scheduling in distributed memory machines”. Parallel Computing. Vol. 32, Issue 10, P.р. 759 – 774. (Eng)
Dümmler J., Rauber T., Rünger G. (2009) “Scalable computing with parallel tasks”. Proc. on the 2nd Workshop on Many-Task Computing on Grids and Supercomputers, MTAGS '09 (Portland, Oregon, November 16 ). Article No. 9, P.р. 1 – 10. (Eng)
