• search hit 4 of 27
Back to Result List

Scaling analysis of solving algorithms for canonical problem of dispatching in the context of dynamic programming

  • The paper analyses computational model based on dynamic programming for platforms with multicore processors and heterogeneous architectures with FPGA. The models are applied for solving a canonical problem of dispatching where the computation time significantly depends on the problem scale factor. The parallel algorithms of NP-hard problem of dispatching are complicate and require intensive RAM data exchange. In order to reduce the computation time, it is suggested to use FPGA as a coprocessor providing massively parallel computation and increase the operational performance of the system in one order.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Availability
Document Type:Conference Object
Author:Yuriy S. Fedosenko, Mikhail B. Reznikov, Aleksandr S. Plekhov, Roustiam Chakirov, Nigel Houlden
Parent Title (English):Picking, Cunningham et al. (Eds.): 2017 Internet Technologies and Applications (ITA), 12-15 September 2017, Wrexham, Wales, UK
First Page:181
Last Page:184
Date of first publication:2017/11/09
Tag:calculations modeling; discrete optimisation; dispatching problem; graphics processing units; massively parallel calculations
Departments, institutes and facilities:Fachbereich Elektrotechnik, Maschinenbau, Technikjournalismus
Institut für Technik, Ressourcenschonung und Energieeffizienz (TREE)
Dewey Decimal Classification (DDC):6 Technik, Medizin, angewandte Wissenschaften / 62 Ingenieurwissenschaften / 620 Ingenieurwissenschaften und zugeordnete Tätigkeiten
Entry in this database:2017/11/17