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. T...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2017 Internet Technologies and Applications (ITA) S. 181 - 184
Hauptverfasser: Fedosenko, Yuriy S., Reznikov, Mikhail B., Plekhov, Aleksandr S., Chakirov, Roustiam, Houlden, Nigel
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.09.2017
Schlagworte:
calculations modeling
Computational modeling
discrete optimisation
Dispatching
dispatching problem
Dynamic programming
Field programmable gate arrays
Graphics processing units
massively parallel calculations
Random access memory
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/ITECHA.2017.8101934