Scaling Analysis of Solving Algorithms for Canonical Problem of Dispatching in the Context of Dynamic Programming
Fedosenko, Yuriy S, Reznikov, Mikhail B, Plekhov, Aleksandr S, Chakirov, Roustiam and Houlden, Nigel (2017) Scaling Analysis of Solving Algorithms for Canonical Problem of Dispatching in the Context of Dynamic Programming. In: 7th IEEE Int. Conference on Internet Technologies and Applications ITA-17, Wrexham, UK, 12-15 September 2017, Wrexham, UK.
|
Text
GURO_368_3007-1570367981.pdf Download (2MB) | Preview |
Abstract
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.
| Item Type: | Conference or Workshop Item (Poster) |
|---|---|
| Divisions: | Applied Science, Computing and Engineering |
| Depositing User: | Hayley Dennis |
| Date Deposited: | 17 Dec 2018 13:39 |
| Last Modified: | 17 Dec 2018 13:39 |
| URI: | https://wrexham.repository.guildhe.ac.uk/id/eprint/17367 |
Actions (login required)
 |
Edit Item |